Higher-dimensional lattice — where it appears
Named by 14 essays across 4 fields — each of them below, with the objects they name alongside it.
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.
Icosahedral symmetry
Sixty rotations, six fivefold axes, and no lattice in three dimensions that can hold any of them. It is the point group a crystal is forbidden, and the one the first quasicrystal turned out to have.
Six integers, and the lattice that holds them
A fivefold rotation is not an integer matrix in three dimensions and is one in six. The icosahedral group permutes its own six fivefold axes, so in coordinates along those axes every one of its sixty rotations is a signed permutation — and Z⁶ is a lattice it maps onto itself.
The lengths do not name the lattice
Seventeen hundred plane lattices, every one with a theta series shared with no other — the lengths determine the lattice, and an exhaustive search says so. In sixteen dimensions two different lattices have identical counts at every distance, and the example is sixty years old.
Eight-fold, with the golden ratio taken out
The familiar quasicrystals are all built on five: Penrose's rhombs, the Fibonacci chain, the ten-fold pattern Shechtman measured. A method that works only on the golden ratio is a method tuned to its answer — so here is the same construction run on eight, where the irrational is √2 and nothing else changes.
Finitely many is not few
Bieberbach's third theorem says each dimension holds finitely many crystallographic groups and gives no idea how many. The counts are 2, 17, 230, 4783, 222018 and 28927922, and dividing them by the number of arithmetic classes says which of the classification's three steps supplies the explosion — the step that attaches translations, not the one that finds the matrix groups.
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.
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.
The body-centred hypercube is the checkerboard lattice
In three dimensions the centring letters come out as the subspaces a holohedry keeps modulo a prime, and only two and three make new lattices. In four dimensions the same census, run on the six lattices whose symmetry groups are maximal, finds a prime that the three-dimensional argument never could: five centres A₄ into its dual. It also finds that the most familiar centring does not survive the extra dimension. The body-centred hypercubic lattice is not a centred hypercube at all: its body centre is exactly as far away as an edge, and it is D₄, with three times the symmetry.
A seven-fold lattice lives on a folded torus
In six dimensions a lattice can have a seven-fold rotation, and every one that does is the integers of the seventh roots of unity with three weights on it. Up to scale the weights live on a hexagonal torus that a Galois symmetry folds by a third-turn, and the fold has three fixed points: A₆*, A₆, and a third lattice that packs better than either. Centring by sevenths is no longer a reflection, as fifths was in four dimensions. It moves every lattice a third of the way along the torus and carries the three special ones round in a cycle.
The densest eleven-fold lattice is not its own dual
Every ten-dimensional lattice with an eleven-fold rotation is one ring with five weights, and its shapes form a four-dimensional torus folded by a Galois rotation of order five. The seven-fold essay predicted five special lattices, the powers of 1 − ζ, cycled by centring, and all of that holds. What does not carry over is its best result. In six dimensions the densest seven-fold lattice was the one duality fixes. In ten, duality fixes (1 − ζ)³, and the densest is (1 − ζ)², whose dual is (1 − ζ)⁴.
Thirteen-fold, and nothing is its own dual
Every twelve-dimensional lattice with a thirteen-fold rotation is one ring with six weights, and its shapes form a five-dimensional torus folded six ways. The fold has six fixed points, the powers of 1 − ζ, and duality fixes none of them, as in four dimensions and unlike six and ten: it pairs them off. The eleven-fold essay asked whether a longer cycle would let a higher power take over as the densest. It does not. (1 − ζ)² is the densest member at seven, at eleven and at thirteen, whatever duality does.
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.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
CentringKissing numberCyclotomic polynomialsDual latticeBravais latticeCrystallographic restrictionHolohedryQuasicrystalArithmetic crystal classClassificationCompanion matrixCut-and-project