Search Results for ""

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...

The Spencer-Brown form is a simple mathematical concept that formalizes what a mathematical object is formally identical to what it is not (Spencer-Brown 1997, pp. ix and ...

A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...

The nth partial denominator in a generalized continued fraction b_0+K_(n=1)^infty(a_n)/(b_n) or simple continued fraction b_0+K_(n=1)^infty1/(b_n) is the expression b_n. For ...

The strongly embedded theorem identifies all simple groups with a strongly 2-embedded subgroup. In particular, it asserts that no simple group has a strongly 2-embedded ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

A cubic map is three-colorable iff each interior region is bounded by an even number of regions. A non-cubic map bounded by an even number of regions is not necessarily ...