Crystallography & Symmetry
patterns derived from their groups
Concept

Case analysis — where it appears

A proof that finishes by dividing the possibilities into finitely many cases and settling each. The classification of the seventeen is one, it fits on a few pages, and working through it is the difference between knowing a number and knowing why there is no eighteenth.

Named by 4 essays across 2 fields — each of them below, with the objects they name alongside it.

The seventeen sorted by lattice: 2, 5, 2, 3, 5. The five plane lattices, each drawn from the basis every other figure here uses, with the wallpaper groups that sit on it and the order of each against its lattice's holohedry. The counts are 2, 5, 2, 3, 5, which is seventeen again, arrived at by a different route from the case analysis on rotation order. Two relations hold and both are checked. Every group's order divides its lattice's holohedry, because an operation has to map the lattice onto itself before it can map the pattern onto itself — which is why a quarter turn has nowhere to live but a square lattice. And the converse fails on every one of the five: each lattice carries at least one group whose order falls short of what the lattice offers, so knowing the lattice narrows the group to a handful of candidates and never to one. The pairs printed in the accent colour are the groups that take everything their lattice permits.

The classification proof, one branch at a time

Seventeen is a theorem, and the argument that establishes it is a finite case analysis that fits on a few pages. Working through it is the difference between knowing the number and knowing why there is no eighteenth.

classification · Seventeen Every way regular polygons can fill a turn. The seventeen multisets of regular polygons whose interior angles add to exactly 360°, listed with the sum that qualifies each of them. They are found by a search over sizes from three upward: the largest polygon that can appear is the forty-two-gon, which needs a triangle and a heptagon beside it, and the search stops there because the smallest interior angle is a third of a turn so at most six polygons can meet. Nothing here is a table looked up — the list is the output of the search, and every count on the page downstream of it is counted from this one.

Twenty-one vertices, eleven tilings

Regular polygons meeting at a point must fill exactly a turn, which is a Diophantine equation with seventeen answers and twenty-one cyclic arrangements. Ten of the twenty-one tile nothing at all — and the argument that kills them counts places round a polygon rather than measuring anything.

classification · Tilings heesch-two: surrounded 2 times. A shape that tiles nothing, with the rings of copies it does accept: the seed in the first colour and 2 coronas of 7 and 16 copies round it. The search that built this finished, so the shape's Heesch number inside this box is exactly 2, and it cost 3,097 placements. Every cell touching a tile of one ring, corners included, is covered by the next.

Surrounded twice over, and covering nothing

A shape that tiles the plane can be surrounded by copies of itself for ever. A shape that tiles nothing cannot be surrounded for ever — but it can be surrounded once, and sometimes twice, and the number of times is a measurement of how much local success a global impossibility permits.

classification · Decidability the most consistent answer has 100 per cent of the signs. 60 runs of the sign procedure from 60 different random starts, each plotted at its self-consistency — a figure computed without any knowledge of the answer — against the fraction of its signs that are in fact right. Throwing out the 1 run that reached the uniform solution — every sign the same, perfectly consistent and physically a single peak — the highest consistency belongs to a run with 100 per cent of the signs right. The ranking works here, and the reason it works is that the cell is small. Nothing in the plot's horizontal axis knows the answer, which is the only reason a procedure of this kind is a procedure at all.

The formula that has the answer already

The tangent formula rebuilds each phase from all the others, and the true phase set is very nearly a fixed point of it — hand it the answer and it hands the answer back. Start it anywhere else and it does not arrive. Having a fixed point and finding it are different problems, and the second is where the subject spent twenty years.

diffraction · Direct methods

Named alongside it

The objects these essays reach for when they reach for this one.

DecidabilityEnumerationForcingTiling by a groupArchimedean tilingCertificateClassificationDirect methodsEdge to edgeFigure of meritHeesch numberLocal rules

All concepts