Crystallography & Symmetry
patterns derived from their groups
Generator

Periodic and aperiodic order

Periodic and aperiodic order
Periodic and aperiodic order. A periodic pattern repeats: there is a translation that maps it exactly onto itself. An aperiodic one does not, and yet it is completely determined and has sharp diffraction — order and repetition are different properties, which is what quasicrystals forced the subject to separate.

A periodic pattern repeats: there is a translation that maps it exactly onto itself. An aperiodic one does not, and yet it is completely determined and has sharp diffraction — order and repetition are different properties, which is what quasicrystals forced the subject to separate.

3 essays call order-not-repetition. 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 substitution, 6 generations. The rule "every long tile becomes a long and a short, every short tile becomes a long", applied 6 times from a single tile. Each generation is as long as the previous two together, so the tile counts are Fibonacci numbers — 13 long and 8 short at the last row — and their ratio is 1.62500 against the golden ratio's 1.61803. The sequence never repeats and every finite piece of it recurs infinitely often, which is order without periodicity in its smallest form. Order without repetition

The smallest quasicrystal

Two tile lengths on a line, in the golden ratio, in a sequence that never repeats. Three completely different constructions produce it, they are required here to agree, and its diffraction needs two integers per peak where a periodic chain needs one.

 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. Order without repetition

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.

 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. Order without repetition

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.

The whole library · All essays