Math 2.0

Convex and discrete geometry Packing and covering Concept

Sphere packing

Summary

A sphere packing is an arrangement of balls in space that do not overlap. The classical question asks for the largest fraction of space that a packing of equal balls can fill, its packing density. The answer is known in dimensions 11, 22, 33, 88 and 2424. In the plane it is the hexagonal packing, and in space the face-centred cubic packing of the Kepler conjecture. In dimensions 88 and 2424 it is given by the E8 lattice and the Leech lattice. Sphere packings are linked with error-correcting codes, lattices, number theory and crystallography.

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Sphere_packing
About this page
TagHF32CBN5MA
URIm2://HF32CBN5MA
Kindconcept
WritingW0 stub
MSC52C17, 11H31, 05B40
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Results about this

Used by

Definitions