Search Results for ""

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

A nonempty finite set of n×n integer matrices for which there exists some product of the matrices in the set which is equal to the zero matrix.

A set that is a smooth embedded two-dimensional manifold except for a subset that consists of smooth embedded curves, except for a set of isolated points.

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...