Generator

The seventeen signatures, and the seventeen groups

The seventeen signatures, and the seventeen groups
The seventeen signatures, and the seventeen groups. Every combination of features costing exactly two, beside the plane group each one names. The left column is produced by an accounting identity that has never heard of a lattice; the right by reading seventeen groups' own operations — their rotation centres and orders, which of those lie on mirrors, and how many closed curves the mirror lines make once equivalent lines are identified. The map between the two lists is a bijection, and the figure does not appear unless it is one — in both directions. A signature with no group and a group whose signature is not on the list are both refused, and so is the failure that actually happens: two groups deriving one signature, which costs exactly two and passes every check but injectivity.

Every combination of features costing exactly two, beside the plane group each one names. The left column is produced by an accounting identity that has never heard of a lattice; the right by reading seventeen groups' own operations — their rotation centres and orders, which of those lie on mirrors, and how many closed curves the mirror lines make once equivalent lines are identified. The map between the two lists is a bijection, and the figure does not appear unless it is one — in both directions. A signature with no group and a group whose signature is not on the list are both refused, and so is the failure that actually happens: two groups deriving one signature, which costs exactly two and passes every check but injectivity.

5 essays call orbifold-cost. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about. Every one of this site's 393 essays names its parameters at the call site, which the standard pass of 2026-08-09 established and param-floor holds.

Where it is called

Changing this generator changes every one of these figures.

The seventeen signatures, and the seventeen groups. Every combination of features costing exactly two, beside the plane group each one names. The left column is produced by an accounting identity that has never heard of a lattice; the right by reading seventeen groups' own operations — their rotation centres and orders, which of those lie on mirrors, and how many closed curves the mirror lines make once equivalent lines are identified. The map between the two lists is a bijection, and the figure does not appear unless it is one — in both directions. A signature with no group and a group whose signature is not on the list are both refused, and so is the failure that actually happens: two groups deriving one signature, which costs exactly two and passes every check but injectivity. The classification

Seventeen dollars

Conway's magic theorem prices the features a folded-up pattern can have — a handle costs two, a mirror boundary one, a cone point of order n almost one — and requires the total to come to exactly two. There are seventeen ways to pay, and the classification falls out of an accounting identity that never mentions a lattice.

The (2, 3, 7) group, in the Poincaré disk. A triangle with angles π/2, π/3 and π/7, reflected in its own three sides until depth 12: 380 triangles, alternating in handedness because every generator is a reflection. The sum 1/2 + 1/3 + 1/7 is less than one, so the triangle does not fit in the flat plane and the drawing is of the hyperbolic one, with the whole plane squeezed inside a disk. Every triangle has the same hyperbolic area; the ones near the edge look small because the model shrinks distances there, and the tiling stops at the edge of the drawing rather than at the edge of anything. The classification

Past two, the list does not stop

Conway's accounting says a wallpaper group costs exactly two dollars, and there are seventeen ways to spend it. Spend less and the answer is a finite group. Spend more and the list is infinite — but the cheapest thing past two costs two and one eighty-fourth, and nothing at all lies in between.

The region, and its copies. Words in S and T up to length 4, each carrying the region somewhere else. The copies do not overlap and they do not leave gaps: the upper half-plane is tiled by them, one copy per change of basis. That is the whole content of the claim that reduction picks a canonical basis — every basis of every lattice is in exactly one copy, and reduction is the walk back to the shaded one. Lattices

Two moves reach every basis

A lattice has infinitely many bases and reduction picks one. Why it can is a fact about a group with two generators and two relations — and the fundamental region tiles the plane with its own copies, one per basis, which is what makes the walk home finite.

p1 folds into a torus. The cell of p1 with its edges marked as the group joins them: both pairs by a plain translation, both arrows the same way round. Gluing top to bottom gives a tube and gluing its ends gives a torus. Nothing in p1 holds a point still, so the surface has no marked points and its first homology is two copies of the integers. The classification

The two that fold into a surface

Fold a wallpaper pattern along its own symmetries and what is left is usually a shape with corners and edges nobody drew. For two of the seventeen it is a plain surface with no marks on it at all — a torus and a Klein bottle — and which two is decided by a single question asked of every operation.

p4m: 4 and 4. The standard motif — three points in no particular arrangement — repeated by p4m, with each copy coloured by the sign of the area of the triangle it makes. 4 copies have one sign and 4 the other, because the group contains an operation that reverses orientation. A structure built from one enantiomer cannot sit here: the group would put its mirror image in the same crystal. The colours were computed from the coordinates rather than assigned. Into space

The groups a single hand may sit in

A protein is built from one enantiomer of every amino acid, and a crystal of it contains nothing else. That single fact deletes most of the classification at a stroke: any operation reversing orientation would put the other hand in the same crystal. The criterion is one line of arithmetic, and in the plane the enumeration is complete — five of the seventeen.

The whole library · All essays