Crystallography & Symmetry
patterns derived from their groups
Concept

Patch frequency — where it appears

How often a given local arrangement occurs in a tiling, as a proportion of all tiles. In an aperiodic tiling the frequencies exist and are the same everywhere, and an irrational frequency is a proof that no period exists — since a periodic tiling's frequencies are ratios of whole numbers.

Named by 5 essays across one field — each of them below, with the objects they name alongside it.

How fast a window's answer settles: 1/L on the chain, 1/√L on a shuffle. The largest error a window of each length makes about a block's frequency, over every position the window can take, on logarithmic axes. The upper line is a shuffle of the chain's own letters — same frequencies, no order — and its slope is close to −½, which is the random walk a sequence with no structure produces. The lower line is the Fibonacci chain itself and its slope is close to −1. The frequency of a block in the chain is therefore something a finite window measures rather than approaches: to know it to a part in a thousand needs a window of a thousand tiles, not a million.

The average is the same wherever it is taken

A measurement is made on a window somewhere, and the question is whether the answer belongs to the chain or to the window. For the Fibonacci chain the error falls as one over the window's length; for a shuffle of the same letters it falls as one over the square root, and the two exponents are fitted rather than asserted.

aperiodic · Complexity 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 How often each block of 5 occurs. Every block of length 5 in the fibonacci chain, with its frequency from the Perron eigenvector of the block substitution and again from a count over a chain of 46368 letters. The two share nothing: one is a linear algebra problem over a matrix of integers, the other a loop over a string. The eigenvalue of the block matrix is the inflation factor of the letter matrix, which is a second check and a stronger one — a chain inflates at one rate whatever length of window is being counted.

How often each patch occurs

That a patch has a frequency at all is the ergodic theorem. What the frequency is turns out to be an eigenvector: the substitution acts on blocks as well as on letters, the block matrix has a Perron vector, and its entries are the frequencies exactly. For the Fibonacci chain those entries take three values at every length, and the three values are the three gaps of a rotation.

aperiodic · Complexity The error in the count, against tiles chosen at random. For clusters from about twenty-five hats to nearly two trillion, the distance of the reflected count from the exact share of all hats. For the hat it stays under one half. For independent random choice at the same share the expected error grows as the square root of the size, past 400,000 at the largest cluster.

The count of reflected hats is never one out

In a hat tiling one tile in about eight is reflected, and that ratio was only ever quoted here. Four clusters and a table of small integers give it exactly: seven plus three root five over two, the fourth power of the golden ratio. The same table says something the ratio does not. Grow a cluster to two trillion hats and its reflected count is still within half a tile of the exact share, where the same share chosen at random would be out by nearly half a million.

aperiodic · Monotile

Named alongside it

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

AperiodicityMonotileAperiodic tile setPolykiteUnique ergodicityAverage structureBounded discrepancyBragg peakChiralityContinued fractionDecidabilityEnantiomorph

All concepts