Crystallography & Symmetry
patterns derived from their groups
Concept

Sphere packing — where it appears

An arrangement of equal balls that do not overlap, measured by the fraction of space they fill. Among lattice packings the densest is known in dimensions one to eight and in twenty-four; in four it is D₄.

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

E₈ has the smallest sum at every width. For four eight-dimensional lattices of unit covolume — D₈, its dual D₈, the cubic lattice Z⁸ and two copies of D₄ — the ratio of their Gaussian sums, less the constant term, to E₈'s, at widths from 0.2 to 5, logarithmic. Every ratio exceeds one everywhere: E₈ wins at every width against every rival. The closest approach is at t = 1, where D₈ and its dual are equal, a factor of 1.31 above E₈. D₈ is the better of the pair at wide widths and D₈ at narrow ones, and neither comes close to E₈ at either end.

In eight dimensions one lattice wins at every width

In space no lattice has the smallest Gaussian sum at every width, because the densest lattice wins when the Gaussian is narrow and its dual wins when it is wide, and fcc is not bcc. The argument fails exactly when the densest lattice is its own dual. In eight dimensions it is: E₈, with 240 shortest vectors, beats D₈, its dual, the cubic lattice and a sum of two four-dimensional lattices at every width tried, by a factor of at least 1.31, and its sum is mirror-symmetric in the logarithm of the width.

lattices · Lengths Almost every descent ends at D₄. At five widths of the Gaussian, twelve local minimisations of the lattice sum over all four-dimensional lattices of unit covolume, each from a random lattice, each marked by where it ends and labelled with the number of shortest vectors of the lattice it ends at. Fifty-nine of the sixty end at D₄, with twenty-four shortest vectors. One, at the widest Gaussian, ends at A₄*, with ten, a lattice whose sum is higher than D₄'s but which no small change lowers.

The two lattices where a four-dimensional descent stops short

In four dimensions the argument that rules out a single best lattice in space has nothing to act on, so whether one lattice wins at every width is left to be measured. A search over every four-dimensional lattice finds D₄ from almost anywhere. The exceptions are the finding: two lattices, A₄ and its dual, where a descent can stop short, each at one end of the widths and neither in the middle, for the same reason Voronoi found four dimensions has two perfect forms.

lattices · Lengths 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

Named alongside it

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

Kissing numberDual latticeCentringCyclotomic polynomialsHigher-dimensional latticeTheta seriesClose packingDualityGram matrixLatticePacking densityPerfect form

All concepts