Search Results for ""

For a quadratic form Q in the canonical form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2, the rank is the total number r of square terms (both positive and ...

On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

A smooth map f:S^1->R^3 whose image has singularities. In particular, in the theory of Vassiliev's knot invariants, singular knots with a finite number of ordinary double ...

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...

The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...

A condition which, if true, guarantees that a result is also true. (However, the result may also be true if the condition is not met.) If a condition is both necessary and ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...