Crystallography & Symmetry
patterns derived from their groups
Concept

Tiling by a group — where it appears

The division of the plane into one region per group element, which is what a fundamental domain repeated becomes. It makes the index of a subgroup visible as an area: half the operations means twice the region.

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

A fundamental domain for p4m. One representative from every orbit of p4m, shaded, with the images that tile the rest of the cell. The domain was found by computing orbits rather than by drawing a region, and every sample's orbit was checked to meet it exactly once — so the region has neither a gap nor an overlap.

The fundamental domain

The smallest piece of a pattern from which the group rebuilds the rest. Drawing one is easy and drawing one correctly is not, because a region with a gap or an overlap looks exactly like a region without.

operations · Fundamental domain 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 a general quadrilateral tiles. A general quadrilateral — convex, with no equal sides and no parallel edges — with copies placed by half-turns about edge midpoints. The patch was checked by sampling 2000 points inside a disc: every one of them lies in exactly one tile, so there is no gap and no overlap anywhere in the region tested.

Which shapes tile by themselves

Every triangle tiles the plane. So does every quadrilateral, convex or not. Six sides admits three families, seven sides admits nothing at all — and the five-sided case took a hundred years and finished with a computer search. The bound at seven needs no search: it is Euler's relation with the curvature set to zero.

classification · Tilings p4: a domain of 38 cells with 7 walls. The fundamental domain of p4 on a grid of 12ths, with the walls it shares with its neighbouring copies marked. Each wall names the element that carries this copy onto the copy across it, and there are 7 distinct such elements. Those elements generate the whole group — checked by closing them up and requiring every coset and the whole translation lattice to be reached, not assumed — which is Poincaré's theorem, and it means the generators of a wallpaper group can be read off a picture. The domain is pixelated rather than a polygon, so the wall count is a property of this domain and not of the group.

Every wall names a generator

The copies of a fundamental domain tile the plane and stand in one-to-one correspondence with the elements of the group. So the elements that carry the home copy across a wall generate everything — and the generators of a wallpaper group can be read off a picture rather than looked up.

operations · Fundamental domain 8 tiles over 5 colours. Wang tiles: unit squares with a colour on each edge, which may be laid side by side only where the touching edges agree, and which may never be turned or reflected. That last restriction is what makes them a computational object rather than a jigsaw — an edge colour is a symbol passed from one tile to its neighbour, and turning a tile would let a symbol change direction. The set here was generated from a stated seed.

Nothing decides whether a set of tiles tiles the plane

This collection rests on decidability — generate a pattern, forget the group, rediscover it, compare. One question in the same subject has no procedure at all: given a finite set of tiles, whether they cover the plane cannot be decided by any algorithm whatever. What can be done is two half-searches, and measuring what they leave behind.

classification · Decidability Y-pentomino: A B C D E F, with 6 arcs. The boundary of the Y-pentomino cut into six arcs. A runs from one corner to another and D is the same arc traversed backwards, so D is a translate of A and the translation is (3, 1) cells. Each of B, C, E and F is carried onto itself by the half turn about its own midpoint, and those midpoints are the four marked dots — That is Conway's criterion, and a shape meeting it tiles the plane by translations and half turns.

A tiling of the whole plane, decided on one tile's edge

Whether a shape tiles the plane is a question about an infinite object, and there is no procedure that answers it. There is a procedure that answers it *sometimes*, and it reads nothing but the shape's own boundary — a closed path of a few dozen steps, cut into six arcs. When the cut exists the tiling exists, and the cut names the group that makes it.

classification · Isohedral anisohedral: 2 orbits of congruent tiles. A tiling of the plane by 8 copies of one shape per cell of a lattice of index 64, drawn 1 cell across and 8 up, and coloured by which orbit of the tiling's own symmetry group each tile belongs to. The group has 4 operations per cell and 2 orbits: every tile is congruent to every other, and no motion of the whole pattern carries a tile of one colour to a tile of another. Congruence is a fact about the shapes; an orbit is a fact about the pattern, and they are different facts.

One shape, two kinds of tile

A tiling by copies of a single shape looks as though it must be homogeneous — every tile is congruent to every other, so what could distinguish them? The symmetry group can. There are shapes that tile the plane and admit no tiling whose group carries any tile to any other, and the smallest of them has eight cells.

classification · Isohedral 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

Named alongside it

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

DecidabilityEnumerationLocal rulesMonohedral tilingCase analysisCertificateConway criterionForcingFundamental domainHalf-turnIsohedralOrbit

All concepts