Crystallography & Symmetry
patterns derived from their groups
Concept

Cyclotomic polynomials — where it appears

The minimal polynomial of a primitive n-th root of unity, whose degree is Euler's totient of n. A lattice rotation turning a plane by a primitive n-th of a turn has it as a factor, so an integer matrix of size two can carry only the orders whose totient is at most two.

Named by 14 essays across 4 fields — each of them below, with the objects they name alongside it.

An integer matrix of order 5. The companion matrix of the 5th cyclotomic polynomial has whole-number entries and order exactly 5, so it is a genuine 5-fold symmetry of a 4-dimensional lattice. The plane it rotates sits at an irrational angle to that lattice, and the lattice's shadow on it is dense — which is why a projection needs a window before it becomes a pattern.

Where five-fold becomes legal

A five-fold rotation with whole-number entries exists — in four dimensions, as a four-by-four matrix that can be written down. The plane forbids it because the plane is too small, and knowing which dimension is large enough changes what a quasicrystal is.

restriction · Restriction The invariant degrees exist for every n; the lattice permits five of them. The reflection group with an n-fold rotation has an invariant ring generated in degrees 2 and n, for every n whatever — the dimensions on the right are counted by pairing monomials in complex coordinates, which needs no matrix and therefore no lattice. Five of these groups can be written in integer matrices, and those five are named in the middle column; the rest cannot, because a lattice has no five-fold or seven-fold rotation. The crystallographic restriction is usually a statement about traces of matrices. Here it is the statement that only five of these invariant rings belong to a crystal, and the two arguments have nothing in common but their answer.

The degrees that name the restriction

The reflection group with an n-fold rotation has invariants of degrees 2 and n — for every n, with no lattice anywhere in the argument. Which of those groups a crystal may have is then the only question left, and its answer is the crystallographic restriction arriving from a direction nobody points it from.

restriction · Restriction Two turns and their undoing leave a slide. A turn g by 90° about the point c and a turn h by 60° about d. The marked point p is carried back 60° about d, back 90° about c, forward 60° about d and forward 90° about c, and does not return: it arrives displaced by a vector of length 2.371, which is 4·sin 45°·sin 30°·|c − d|. Two other points put through the same four motions move by the same vector, drawn beside them, because the commutator g h g⁻¹ h⁻¹ of two rotations of the plane is a translation — (I − A)(I − B)(c − d) exactly — whatever the angles and the centres.

What forces a lattice

Every enumeration here starts from a lattice of translations, and the lattice is usually taken as given. It need not be. A group of motions that is discrete, and leaves no point far from an orbit, has to contain one — in the plane by an argument four lines long, each line a picture, and in space by an inequality whose threshold turns out to be the six-fold rotation.

restriction · Finiteness Three rotations of order twelve, and one twelve-fold. Three integer 4 × 4 matrices of order twelve, one from each rational class of that order on a four-dimensional lattice. A four-dimensional rotation turns two perpendicular planes, and each plane is drawn as a dial: a point, its images, and the path the operation takes round them. Φ₁₂ turns its planes by one twelfth and five twelfths of a turn, so a point runs round twelve positions. Φ₃ ⊕ Φ₄ turns one plane by a third and the other by a quarter, and Φ₄ ⊕ Φ₆ by a quarter and a sixth; each has order twelve because twelve is the least common multiple, and neither has a plane with twelve positions in it.

Three rotations of order twelve

A four-dimensional lattice can be carried onto itself by three different integer matrices of order twelve, and only one of them turns anything by a twelfth of a turn. The totient that is usually said to decide which orders a dimension permits decides something else: which angles. The orders are decided by a sum over blocks, the two lists part company at six dimensions, and space already has an operation whose order is not its angle.

restriction · Restriction Which four-dimensional lattices carry which rotations of order twelve. Six four-dimensional lattices, the order of each one's symmetry group, and how many of its symmetries are of each of the three kinds of order twelve: the single block Φ₁₂, the third-turn with a quarter-turn Φ₃Φ₄, and the quarter-turn with a sixth-turn Φ₄Φ₆. D₄ has 96 of the first among 1,152 symmetries, the two hexagonal planes 24 among 288, and the hexagonal-and-square sum 4 of each of the other two among 96. No lattice has all three, and none has the first with either other.

No lattice carries all three twelves

Four-dimensional lattices admit three different operations of order twelve: one that turns a single irreducible block by a twelfth, and two that turn two planes, by a third and a quarter or by a quarter and a sixth. Computing the symmetry group of every kind of four-dimensional lattice that can have a maximal one shows that no lattice carries all three, and none carries the first with either of the others. D₄, the most symmetric of them, has only the first.

restriction · Restriction One group without an axis, and as many as the order with one. For a rotation of each order that an integer matrix can have in a small dimension, the number of space groups its arithmetic class admits — computed from the cohomology rather than enumerated. A rotation acting on the smallest lattice that will hold it fixes no direction and admits exactly one group: the symmorphic one, with no screw. Add a direction it leaves alone and the count becomes the order of the rotation, and the extra groups are its screws. The four-fold with an axis gives four, which are P4, P4₁, P4₂ and P4₃; the five-fold with an axis gives five, in five dimensions, where no published table exists to check it against.

The screw a dimension does not have

The extension count is a machine that runs in any dimension, and the seventeen were the case where every step could be checked against a list arrived at four other ways. Run on a cyclic point group it has a closed form two lines long — and it says a five-fold screw axis does not exist in four dimensions, which is a prediction rather than a check.

classification · Cohomology Twelve kinds of operation six dimensions adds, and the lattices that carry them. The twelve rational kinds of operation whose orders first appear in five or six dimensions — 7, 9, 14, 15, 18, 20 (two kinds), 24 (two) and 30 (three) — against six lattices whose symmetry groups were computed element by element. Every kind is carried by at least one. All three kinds of order thirty are carried by A₄ ⊕ A₂, forty-eight symmetries each; the single-block kinds Φ₇ and Φ₁₄ only by A₆, and Φ₉ and Φ₁₈ by E₆ and by three hexagonal planes.

The thirties share a lattice

Four dimensions has three kinds of operation of order twelve and no lattice carries all three. Six dimensions has three kinds of order thirty, and one lattice carries every one of them, forty-eight times each. The difference is not the order. One of the twelves is a single block that cannot be split, and no thirty is: thirty needs eight dimensions to be irreducible, so in six it is always a five-fold piece beside a three-fold one, and the lattice that is both pieces holds every combination.

restriction · Restriction How many superstructures a diffraction pattern tells apart. For two-species superstructures of the square lattice with one to twelve sites in the primitive cell: the number of structures, and the number of classes that the positions of their superlattice spots separate them into, the positions together with the composition, and every intensity. At twelve sites 2,012 structures give 167 sets of spot positions, 504 with the composition and 1,815 sets of intensities. At five, seven and eleven sites the positions distinguish only the cells; the intensities distinguish everything. The bar shows the share resolved by positions, dark, and by intensities, light.

The spots say the cell and little else

Of the 2,012 two-species superstructures of the square lattice with twelve sites in the cell, more than half light every superlattice spot their cell allows, so the positions of the spots say which cell and nothing more. Positions separate the 2,012 into 167 classes, the composition takes that to 504, and every intensity to 1,815. At a prime number of sites no spot is ever missing, because a sum of distinct p-th roots of unity cannot vanish.

operations · Counting When a three-species superstructure's spots can go dark. Every structure of three species on the square lattice with three to eight sites in its primitive cell, using all three species, and every superlattice spot of each, sorted by whether the spot is dark for every choice of scattering contrasts, dark at exactly one ratio of the two contrasts, or never dark; with the number of distinct ratios and their degree over the rationals. At the primes 3, 5 and 7 no spot is dark for all contrasts and no dark ratio is rational: none at three sites, quadratic ones at five and cubic at seven. At four and six sites every dark ratio is rational, at eight some are and some are not, and at six and eight some spots are dark for every contrast.

Three species hide a spot at the golden ratio

With two species and a prime number of sites in the cell, no superlattice spot can ever be missing, because a sum of distinct roots of unity of prime order vanishes only when it is all of them. With three species the structure factor weighs two sums against each other with two scattering contrasts, and the argument changes shape without breaking. At a prime size no spot is dark for every contrast and none at a rational ratio of them, but a spot can be dark at one irrational ratio: at five sites, a power of the golden ratio. It happens only in structures with a centre of symmetry.

operations · Counting Three-species arrangements whose sums are parallel at every spot, with and without a centre. Every arrangement of three species, all present, on a cyclic cell of four to nineteen sites. The third column counts those whose two phase sums are parallel at every superlattice spot, the fourth those among them with a centre of inversion, the fifth those without one, and the last how many kinds the exceptions make up to translation, inversion, relabelling the spots and renaming the species. Primes are shaded. At 5, 7 and 11 sites every parallel arrangement has a centre; at 13 sites 936 do not, and they are all one arrangement; at 17 there are 17 kinds and at 19 there are 48.

Thirteen sites obey Friedel's law without a centre

At five and seven sites the earlier census found that a three-species structure has a contrast that darkens a spot exactly when it has a centre, and asked whether that is a theorem. It is not. The two phase sums are parallel exactly when the A–B pairs are as common at every separation forwards as backwards, and exactly when no anomalous scatterer can produce a Bijvoet difference anywhere in the pattern. At 5, 7 and 11 sites only a centre achieves that. At 13 sites one arrangement does it without one.

operations · Counting The 8 special 17-fold lattices in 16 dimensions. The 8 lattices at the fixed points of the Galois fold on the torus of 17-fold lattices: A16*, A16 and the ideals (1 − ζ)² to (1 − ζ)⁷ with the trace form. For each, its place on the torus, its minimum where it reaches the bound 2kp, its kissing number (34, 272, 952, 1088, 476, 816, 306, 34), its centre density at determinant one (0.0000, 0.0009, 0.0143, 0.0215, 0.0126, 0.0191, 0.0112, 0.0007), and which of them its dual is. The densest, (1 − ζ)³, is shaded: the third power, where the seven-, eleven- and thirteen-fold families had the second.

At seventeen the densest power of 1 − ζ moves

Three primes running, the densest lattice with a p-fold rotation sat at the second power of 1 − ζ. At seventeen, in sixteen dimensions, and at nineteen, in eighteen, it sits at the third. The move is not a surprise once the minima are read: every power up to the fourth reaches Craig's bound exactly, which turns each density into a formula and the competition between powers into an inequality. The second power wins exactly while (3/2) raised to half of p − 1 stays below p, and the formula's next prediction, the fourth power at twenty-three, comes true by three per cent.

lattices · Centring A shortest vector of a sixteen-dimensional lattice, as a polynomial with two full fibres. The values of f(t) = t(t − 1)(t − 2)(t − 3) at every t in the field of 17 elements, value against t. It takes the value 0 at the four points 0, 1, 2, 3 and the value 12 at the four points 3, 5, 12, 14. Those two fibres are two sets of four with equal first, second and third power sums modulo 17, so the vector with +1 on one set and −1 on the other lies in (1 − ζ)⁴, with squared length 8 in the trace form's units of 17: Craig's bound, attained.

The shortest vector is a polynomial with two full fibres

Whether Craig's lattices reach their bound, minimum 2kp for the ideal (1 − ζ)ᵏ, looked like a question for shortest-vector searches in twenty-eight to thirty-six dimensions. It is a question about polynomials over the field of p elements. The bound is reached exactly when some polynomial of degree k takes two values k times each, and every divisor of p − 1 supplies one. Read that way, every power at 29, 31 and 37 is settled, the densest are the fourth, fourth and fifth as predicted, and past the middle of each cycle the minimum climbs until it meets the vector of quadratic residues and stops.

lattices · Centring Seventeen ways to have order thirty in eight dimensions, and four on E₈. Every product of cyclotomic polynomials of total degree eight whose order is thirty: 17 of them. E₈'s symmetry group holds 4: the single block Φ₃₀ and three split kinds, each with a one-dimensional piece of each sign or a doubled minus one. The other thirteen fit the dimension and have no element on this lattice.

Thirty as one block lives on two lattices

Eight dimensions is where an operation of order thirty can finally be a single irreducible block. It was predicted to sit alone on E₈ with the split kinds elsewhere, as the twelves do in four dimensions. It does not: E₈ holds three split thirties beside it, and exactly three of the sixteen that fit, because a five-fold block leaves nothing but a permutation of five things. The block also lives on a second lattice, A₂ ⊗ A₄, and there it really is alone.

restriction · Restriction Every form tried, by its symmetries and by how well it packs. 5902 totally positive forms of the ring of fifteenth roots of unity, sorted by the order of their symmetry group into five rows. Forms with 60 and 120 symmetries form scattered bands. Two lattices have 1,440, the tensor products of A2 with A4 and with its dual. One has 14,400, a member of the icosian line; one has 28,800, the icosian ring with its plain trace; and one is E8. The highest Hermite number among forms with only 60 symmetries is above that of the 28,800 lattice.

One ring is E8 and a lattice with no mirror

An operation of order thirty as one block in eight dimensions preserves a whole family of forms, and E₈ was one point of it. Walking the family finds sixty symmetries almost everywhere and two lines above that. One is tensor products. The other is the icosian ring, on which E₈ is famously built, under a sliding choice of form: 14,400 symmetries all along it, 28,800 and not one reflection at one end, and at the other end E₈, where the group jumps by a factor of nearly fifty thousand.

restriction · Restriction

Named alongside it

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

Crystallographic restrictionHigher-dimensional latticeRoot of unityStructure factorSuperstructureWeyl groupCentringCompanion matrixEnumerationHomometryKissing numberSphere packing

All concepts