Crystallography & Symmetry
patterns derived from their groups
Series

Complexity — the series

10 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. 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.

    part 1 · aperiodic
  2. 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.

    part 2 · aperiodic
  3. 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.

    part 3 · aperiodic
  4. 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.

    part 4 · aperiodic
  5. 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.

    part 5 · aperiodic
  6. A peak that grows, and not fast enough. The strongest peak of three chains, divided by the square of the number of letters, as each chain is lengthened. A Bragg reflection is a sum of terms in phase, so its intensity grows as the square of the count and this number settles: the Fibonacci chain and the period-doubling chain both do, at exponents of about two. The Thue–Morse chain does neither — its strongest peak grows, so it is not diffuse scattering, and it grows more slowly than the square, so it is not a Bragg peak. The fitted exponents are printed beside each curve and no threshold enters the comparison.

    Neither a peak nor a bump

    A chain whose strongest reflection grows as the length to the power one and a half. A Bragg peak grows as the square and a diffuse bump grows as the length itself, so this is neither — and the essay that ruled out the first possibility could only say so by quoting a theorem.

    part 6 · aperiodic
  7. 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.

    part 7 · aperiodic
  8. 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.

    part 8 · aperiodic
  9. Every vertex of a Penrose patch, by the symmetry of what lies within three edges of it. A region of a Penrose rhomb tiling 15.2 edges across. Each vertex is marked by the local group of the patch of radius 3.05 edges about it: a short line along the mirror where that patch has one (98 vertices), a large dot where it has a five-fold centre (7), and a small dot where it has no symmetry at all (118). The mirrors are common and point in the tiling's ten directions; the five-fold centres are rare; nothing has a half-turn.

    Five-fold centres stay few, and mirrors do not

    The Fibonacci chain has one palindrome of every even length and two of every odd length, for ever. Run the same census on the patches of a Penrose tiling and the plane gives three different answers at once. Patches with a five-fold centre stop at four, however large they are drawn. Patches with a mirror grow in number with their radius, by about fifty for every edge. And no patch wider than a single tile has a half-turn at all. What decides which answer an operation gets is the size of the set it leaves fixed in internal space.

    part 9 · aperiodic
  10. Patches of an icosahedral quasicrystal grow with the dimension their symmetry fixes. The number of distinct patches about a vertex of the canonical icosahedral quasicrystal that keep a given symmetry, against the patch's radius in edges on logarithmic axes, counted per axis or per mirror plane: along a five-fold, a three-fold and a two-fold axis, and across a mirror plane. The axes' counts grow in proportion to the radius and the mirror's as its square, the slopes given are the last four points'. Along the bottom, the patches with an inversion centre: one up to a radius of 1.9 edges, and none from 2.15 on.

    In space, a five-fold axis is a line

    In a Penrose tiling the patches with a five-fold centre stop at four, however large they are drawn, because a five-fold rotation fixes only a point of the tiling's internal space. Slice a quasicrystal from six dimensions instead of four and the internal space has three dimensions, where a rotation fixes a whole line. The five-fold patches of the icosahedral quasicrystal then grow in number with their radius, from five to forty-six per axis, while the patches with a centre of inversion, which fixes only a point, vanish past two edges. Counting them takes internal space: a sample of vertices cannot.

    part 10 · aperiodic

All series