Crystallography & Symmetry
patterns derived from their groups
Concept

Sturmian — where it appears

A sequence with exactly one more block of each length than the length, which is the fewest an aperiodic sequence can have. The Fibonacci chain is one, which makes it the most economical aperiodic chain there is.

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

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 Every window returns within 3.0 n. For each window length, the largest distance between two consecutive occurrences of the same window, measured over 46,368 tiles. The gaps are Fibonacci numbers, and the ratio to the window length stays below 3.00 — the chain is linearly repetitive. That is a strong statement of uniformity: there is no stretch of the chain, however far out, in which a given patch fails to occur within a bounded multiple of its own size.

Every patch comes back

A chain that never repeats still repeats everything in it. Every block of tiles occurs again, and again, within a bounded multiple of its own length — and how large that multiple is turns out to be a fact about the continued fraction of a slope.

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 21 points, 3 gap lengths. The first 21 multiples of 377/610, marked on a circle of circumference one, together with the point at zero. The 22 gaps between neighbours take 3 distinct lengths — 13/610 (1 of them), 21/610 (9 of them), 34/610 (12 of them). The largest is the sum of the other two: 13 + 21 = 34. Every quantity here is a whole number over the denominator, so nothing is measured.

Three gaps, and never four

Mark the points α, 2α, 3α round a circle of circumference one. They look scattered. The gaps between neighbouring points do not: for every angle and every number of points there are at most three distinct gap lengths, and when there are three the largest is the sum of the other two. That is where a chain with exactly two tile lengths comes from.

aperiodic · Complexity Mirrors everywhere in a chain with none. Thirty-four tiles of the Fibonacci chain, long tiles L and short tiles S, with an arc over every window of at least 5 tiles that reads the same backwards, drawn from its own centre, and a tick at the centre where its mirror stands. The chain as a whole has no mirror, since no palindrome in it is infinite, yet mirrors of every size stand all along it, the long ones spaced further apart than the short ones, and every one of them a local symmetry the chain lacks globally.

A chain with no mirror has mirrors everywhere

The Fibonacci chain has no mirror: nowhere can it be reflected onto itself. Yet it holds exactly one window of every even length that reads the same backwards and exactly two of every odd length, each recurring all along the chain, and no aperiodic chain that is not of its kind manages that count. Every letter of it creates a palindrome never seen before, and a mirror of any size is never further away than a fixed multiple of that size.

aperiodic · Complexity

Named alongside it

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

Factor complexityThe Fibonacci chainBalanceLong-range orderRepetitivityAperiodicityContinued fractionGolden ratioIrrational slopeLocal indistinguishabilitySubstitutionCut-and-project

All concepts