Lattice sum — where it appears
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
The sum that turns a lattice into its dual
Put a Gaussian on every point of a lattice and add them up. The answer equals the same sum over the dual lattice with the width inverted and the covolume divided out — exactly, to the last bit a double carries, on lattices with no symmetry in them. The identity is free and the reason to have it is that the two sides do not cost the same: at one end of the range the direct sum needs forty thousand terms and the dual sum needs a hundred and twenty-five.
The sum whose answer depends on the shape
Give the points of a cubic lattice alternating signs and add up one over the distance. Added over expanding cubes the total creeps towards 1.747565; added over expanding spheres it does not converge at all, landing on both sides of that number and never settling. The terms are identical and only the order differs. Splitting the sum in two with the theta transformation gives it a value — ten decimal places from a few thousand terms.
No lattice in space wins at every width
Spread a Gaussian over every point of a lattice and add them up. In the plane one lattice gives the smallest sum at every width — the hexagonal one — and that is a theorem. In space no lattice does, and the proof is two lines: at large widths the winner must be the densest lattice, at small widths it must be the densest lattice's dual, and in space those are face- and body-centred cubic. They change places at exactly the width where each is the other's dual.
Named alongside it
The objects these essays reach for when they reach for this one.
Dual latticeTheta seriesReciprocal latticeClose packingConvergenceDualityGram matrixPoisson summationSublattice