Search Results for ""

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

A right-angled parallelepiped with dimensions a×ab×abc, where a, b, and c are integers.

Given a Euclidean n-space, H_n=n+1.

A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual graph edge.

A vector field v for which the curl vanishes, del xv=0.

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

A minimization of the maximum error for a fixed number of terms.

A set M of all polynomials in s variables, x_1, ..., x_s such that if P, P_1, and P_2 are members, then so are P_1+P_2 and QP, where Q is any polynomial in x_1, ..., x_s.

A sequence {a_n} such that either (1) a_(i+1)>=a_i for every i>=1, or (2) a_(i+1)<=a_i for every i>=1.

An element B of a ring is nilpotent if there exists a positive integer k for which B^k=0.