Crystallography & Symmetry
patterns derived from their groups
Concept

Aperiodicity — where it appears

Having no translation that carries a structure onto itself, which is compatible with complete determinacy and with sharp diffraction. For most of a century order and periodicity were used interchangeably, because every ordered structure anybody knew repeated.

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

A Penrose tiling, 4 inflations. Two rhombs, subdivided into smaller copies of themselves over and over. The result covers the plane, has five-fold symmetry about its centre, and never repeats — there is no translation that maps it to itself.

Penrose tilings

Two rhombi, a rule about how their edges may meet, and a tiling that covers the plane completely and never repeats. The five-fold symmetry a lattice forbids, obtained by giving up the lattice.

aperiodic · Aperiodic The Fibonacci chain: p(n) = n + 1. The number of distinct windows of each length in the Fibonacci chain, measured by sliding a window along 46,368 tiles. Every count is checked against the same count on half the chain, and only lengths where the two agree are drawn — a factor count on a finite word is otherwise a lower bound wearing the clothes of an answer.

n plus one, and no fewer

Slide a window along a chain and count what it can show. A periodic chain runs out of new views; an aperiodic one never does; and the fewest an aperiodic chain can manage is one more than the window's length — which is exactly what the Fibonacci chain manages.

aperiodic · Complexity One patch of radius 2. A Penrose patch of 476 vertices, with the vertices within 2 edge lengths of one of them marked and the circle drawn. That marked set, written in coordinates relative to its centre, is what the census compares: two vertices have the same patch when their marked sets agree. Every vertex of the tiling is the centre of one such patch, and the question is how many different ones there are.

How many patches of each size

A periodic tiling has one kind of neighbourhood however far out you look. Random points have as many kinds as neighbourhoods. A Penrose tiling has a number in between that never stops growing and never catches up — and the count is a measurement rather than a theorem.

aperiodic · Complexity 625 tiles, 32 directions. The subdivision applied 4 times to one right triangle with legs 1 and 2, giving 625 tiles of one shape and size. They point in 32 distinct directions — the tint follows the direction — and the count grows every time the rule is applied, without bound.

The tiling that points every way

A Penrose tiling never repeats and its tiles still point in only ten directions, which is why its diffraction pattern has ten-fold symmetry. One triangle, cut into five copies of itself, breaks that — and the difference between it and a tiling with eight directions is which diagonal of one small rectangle gets drawn.

aperiodic · Aperiodic 66 squares and 106 rhombs. The Ammann–Beenker tiling, built by keeping the points of a four-dimensional lattice whose companion image falls inside an octagon and projecting them into the plane. Every tile has the same edge length; the squares and the forty-five degree rhombs are told apart by their diagonals. Nothing was placed — the faces were found among the projected points.

Eight-fold, with the golden ratio taken out

Every quasicrystal on this site has been built on five: Penrose's rhombs, the Fibonacci chain, the ten-fold pattern Shechtman measured. A method that works only on the golden ratio is a method tuned to its answer — so here is the same construction run on eight, where the irrational is √2 and nothing else changes.

aperiodic · Quasicrystals 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 The hat: eight kites, thirteen sides. The shape a search over the eight-kite polykites returns, drawn on the kite grid it lives in — the Laves tiling [3.4.6.4], in which every hexagon is cut into six kites. The eight kites of the shape are tinted and its outline is drawn heavy. Thirteen sides result, of two lengths only: a half and root three over two, in units of the hexagon's circumradius, with one side of twice the shorter length where two kite edges lie in a line. Its interior angles are 90, 120, 240 and 270 degrees. Nothing about the shape was chosen: it is the one octakite that clears every filter in the search.

One tile, and no period

Every aperiodic pattern in this collection so far needs two shapes. A search over the eight-hundred-and-seventy-three ways of gluing eight kites together, filtered by nothing but whether a shape tiles and whether it repeats, returns exactly one — and it is the shape announced in 2023.

aperiodic · Monotile Unreflected copies stop at 1 ring. Copies of the hat, all of the same handedness, covering a core of 1 ring of hexagons — 9 tiles, every cell covered once. At 2 rings the same search runs to exhaustion and returns nothing: there is no such covering, and the failure is a proof for that region rather than a search that gave up. The reflected copy is not a convenience of the drawing; the tiling cannot proceed without it.

The tile that needs no reflection

One shape tiles the plane and never repeats, and it does it with copies of both hands. Cut the tiles out of card and that is nothing; ask for it in a molecule, where handedness cannot be undone by turning something over, and it is the whole question.

aperiodic · Monotile 656 sets, every one decided. Every set of one, two, three and four tiles over two colours — sixteen tiles exist in all, so these are complete lists rather than samples — reduced by relabelling the two colour alphabets, and each set decided by the two half-searches. The last column is the one that matters: it is empty. At these sizes there is no room for a set that tiles the plane and admits no periodic tiling, which is the residue undecidability lives in. The smallest aperiodic set is known to have eleven tiles and four colours.

How much room a hard question needs

No algorithm decides whether a set of tiles covers the plane. Every set of four or fewer tiles over two colours is nevertheless decided here, exhaustively, in under a second — because the sets that defeat the two half-searches have nowhere small to live.

classification · Decidability One hat patch laid out as hats, as equilateral tiles and as turtles. A patch of 36 hats found by exact cover on the kite grid, 4 of them reflected and drawn in the second colour, laid out three times. Every edge keeps its direction; short edges and long edges are given their own lengths. At short 1 and long √3 the tiles are hats, at equal lengths they are the equilateral member of the family, and at short √3 and long 1 they are turtles. In all three the same tiles touch the same neighbours along the same edges, and each layout was checked to be a tiling: 0 gaps and 0 overlaps, 0 gaps and 0 overlaps, 0 gaps and 0 overlaps among 1500 sample points, and every interior vertex surrounded by a full turn.

The hat and the turtle are one tiling

The hat has short sides and long sides; the turtle has the same turns with the two lengths exchanged, and looks nothing like it. Take a patch of hats, keep every edge pointing the way it points, stretch the short edges and shrink the long ones, and the patch becomes a patch of turtles — every tile touching the same neighbours along the same edges.

aperiodic · Monotile A patch of hats scatters a pattern that repeats. The diffracted intensity of the 1217 points of a patch of 183 tiles laid out as the hat, over 2 by 2 cells of the kite grid's reciprocal lattice, whose edges are the faint lines. Every local maximum above a hundredth of the central peak is a disc with area proportional to its intensity; 12 reach the central peak's full height. 72 maxima are drawn. Adding a reciprocal lattice vector to the scattering vector changes the intensity by at most 1.1e-15 of the central peak, so each cell holds the same pattern.

How much of the hat is a crystal

Put a scatterer on every corner of a patch of hats and the diffraction pattern repeats exactly, because every corner sits on a lattice. Inside each repeat the strongest reflections are those of an ordinary crystal with partly filled sites, and by Parseval's identity they carry sixty-three per cent of what the pattern holds. The aperiodicity the hat is famous for lives in the remaining third, in reflections a hundred times weaker.

aperiodic · Monotile Identical layers, each turned by an angle no number of turns undoes. Plan views of 4 layers of a stack. Each layer is the same square lattice with one cell shaded and one direction drawn, and each is turned from the one below through the angle whose cosine is three fifths, about 53.13 degrees. That angle is not a rational part of a full turn, so no number of layers brings the drawn direction back to where it started. A tiling of space with this structure has a symmetry that turns one layer onto the next and climbs one layer, and it has no translation.

Aperiodic is two words in space

A tile is aperiodic when none of its tilings is periodic, and periodic has been read two ways: a tiling with a translation, or a tiling with infinitely many symmetries. In the plane those are one condition, provably. In space they come apart, and a prism found in 1988 sits exactly in the gap.

aperiodic · Monotile

Named alongside it

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

MonotileAperiodic tile setDecidabilityLaves tilingMatching rulesPolykiteSelf similarityChiralityCut-and-projectDiffractionDiscretenessFactor complexity

All concepts