Packing density — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
The densest packing of a shape that is not a disc
Which lattice packs equal discs most densely has a proof that finishes. Replace the disc with a pentagon and the same question has no closed form, but it does have a reduction: translates overlap exactly when the difference of their positions lies inside the shape minus itself, so the question becomes the smallest determinant a lattice can have while avoiding one convex body — and that is a search with a resolution attached.
One perfect form in space
Which lattice packs spheres most densely is a question about a maximum over a continuum, and Voronoi turned it into a rank calculation and a sign check. A lattice is a local maximum exactly when its shortest vectors pin its shape down completely and its inverse can be written over them with positive coefficients. Searching every reduced integer form of minimum two finds one such lattice in the plane and one in space.
Named alongside it
The objects these essays reach for when they reach for this one.
Admissible latticeBravais latticeChange of basisConvex bodyCritical determinantDeterminantDifference bodyDual latticeGram matrixLatticeLattice packingMinkowski theorem