Search Results for ""

A weighted graph in which the weights are equal to the Euclidean lengths of the edges in a specified embedding (Skiena 1990, pp. 201 and 252).

A system of congruences a_i mod n_i with 1<=i<=k is called a complete residue system (or covering system) if every integer y satisfies y=a_i (mod n) for at least one value of ...

Exotic cohomology is a cohomology theory that extends index theory to a larger class of manifolds.

The knots that make up a knot sum of a composite knot are known as factor knots (Adams 1994, p. 8).

A game in which each player has a finite number of moves and a finite number of choices at each move.

The fitting subgroup is the subgroup generated by all normal nilpotent subgroups of a group H, denoted F(H). In the case of a finite group, the subgroup generated will itself ...

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...

Frey's theorem states that every Abelian category is a subcategory of some category of modules over a ring. Mitchell (1964) has strengthened this, saying every Abelian ...

A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...