Abstract: It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher efficiency than balls. We also show that in dimensions 4, 5, 6, 7, 8, and 24 there are origin-symmetric convex bodies of arbitrarily small asphericity that cannot be packed using a lattice as efficiently as balls can be.
Recommendations
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
- Sphere packing in R 3
- Sphere packings. III: Extremal cases
- On Packing of Minkowski Balls
- A new packing density bound in 3-space
- scientific article; zbMATH DE number 739006
- On Three-Dimensional Packing
- Minimization of the container for packing of three cubes in dimension 4
- Anti-Pasch optimal packings with triples
Cites work
- scientific article; zbMATH DE number 1859030 (Why is no real title available?)
- scientific article; zbMATH DE number 783365 (Why is no real title available?)
- scientific article; zbMATH DE number 3055550 (Why is no real title available?)
- A note on optimal unimodular lattices
- A proof of the Kepler conjecture
- Convex and Discrete Geometry
- Convolutions and multiplier transformations of convex bodies
- Optimality and uniqueness of the Leech lattice among lattices
- Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon
- The colossal book of mathematics. Classic puzzles, paradoxes, and problems. Number theory, algebra, geometry, probability, topology, game theory, infinity and other topics of recreational mathematics
Cited in
(4)
This page was built for publication: The 3-ball is a local pessimum for packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400987)
