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 , , , and . In the plane it is the hexagonal packing, and in space the face-centred cubic packing of the Kepler conjecture. In dimensions and 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
About this page
| Tag | HF32CBN5MA |
|---|---|
| URI | m2://HF32CBN5MA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C17, 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
- Kepler conjecture
- Rogers' bound
- Hilbert's eighteenth problem
- Minkowski–Hlawka theorem
- Sphere packing in dimensions 8 and 24