Search Results for ""

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...

In the plane, the reflection property can be stated as three theorems (Ogilvy 1990, pp. 73-77): 1. The locus of the center of a variable circle, tangent to a fixed circle and ...

The (small) rhombicosidodecahedron (Cundy and Rowlett 1989, p. 111), sometimes simply called the rhombicosidodecahedron (Maeder 1997; Wenninger 1989, p. 27; Conway et al. ...

The snub dodecahedron is an Archimedean solid consisting of 92 faces (80 triangular, 12 pentagonal), 150 edges, and 60 vertices. It is sometimes called the dodecahedron simum ...

The stomachion is a 14-piece dissection puzzle similar to tangrams. It is described in fragmentary manuscripts attributed to Archimedes as noted by Magnus Ausonius (310-395 ...

A triangle center function (sometimes simply called a center function) is a nonzero function f(a,b,c) that is homogeneous f(ta,tb,tc)=t^nf(a,b,c) (1) bisymmetry in b and c, ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...