Search Results for ""

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

In three dimensions, there are three classes of constant curvature geometries. All are based on the first four of Euclid's postulates, but each uses its own version of the ...

g_(ij)=[0 1 0 0; 1 0 0 0; 0 0 0 -1; 0 0 -1 0]. It can be expressed as g_(ab)=l_an_b+l_bn_a-m_am^__b-m_bm^__a.

A number theoretic function is a function whose domain is the set of positive integers.

The study of numbers for the supposed purpose of predicting future events or seeking connections with the occult.

Obstruction theory studies the extensibility of maps using algebraic gadgets. While the terminology rapidly becomes technical and convoluted (as Iyanaga and Kawada (1980) ...

A pair of quantities (a, b) where ordering is significant, so (a, b) is considered distinct from (b, a) for a!=b.

A point p on a regular surface M in R^3 is said to be parabolic if the Gaussian curvature K(p)=0 but S(p)!=0 (where S is the shape operator), or equivalently, exactly one of ...

A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.