Crystallography & Symmetry
patterns derived from their groups
Concept

Three distance theorem — where it appears

The gaps between the first n multiples of an irrational angle marked round a circle take at most three lengths. The largest is always the sum of the other two, which is where a chain with exactly two tile lengths comes from — and those three gaps are the frequencies of the chain's blocks of each size.

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

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 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

Named alongside it

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

Continued fractionFactor complexityBalanceThe Fibonacci chainGolden ratioInflation factorIrrational slopePatch frequencyPerron eigenvectorSturmianSturmian wordSubstitution

All concepts