Ulam's packing conjecture

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Question dropshade.png Unsolved problem in mathematics:
Is there any three-dimensional convex body with lower packing density than the sphere?
(more unsolved problems in mathematics)

Ulam's packing conjecture, named for Stanislaw Ulam, is a conjecture about the highest possible packing density of identical convex solids in three-dimensional Euclidean space. The conjecture says that the optimal density for packing congruent spheres is smaller than that for any other convex body. That is, according to the conjecture, the ball is the convex solid which forces the largest fraction of space to remain empty in its optimal packing structure. This conjecture is therefore related to the Kepler conjecture about sphere packing. Since the solution to the Kepler conjecture establishes that identical balls must leave ≈25.95% of the space empty, Ulam's conjecture is equivalent to the statement that no other convex solid forces that much space to be left empty.

Origin[edit]

This conjecture was attributed posthumously to Ulam by Martin Gardner, who remarks in a postscript added to one of his Mathematical Games columns that Ulam communicated this conjecture to him in 1972.[1] Though the original reference to the conjecture states only that Ulam "suspected" the ball to be the worst case for packing, the statement has been subsequently taken as a conjecture.

Supporting arguments[edit]

Numerical experiments with a large variety of convex solids have resulted in each case in the construction of packings that leave less empty space than is left by close-packing of equal spheres, and so many solids have been ruled out as counterexamples of Ulam's conjecture.[2] Nevertheless, there is an infinite space of possible shapes that have not been ruled out.

Yoav Kallus has shown that at least among point-symmetric bodies, the ball constitutes a local maximum of the fraction of empty space forced.[3] That is, any point-symmetric solid that does not deviate too much from a ball can be packed with greater efficiency than can balls.

Analogs in other dimensions[edit]

The analog of Ulam's packing conjecture in two dimensions would say that no convex shape forces more than ≈9.31% of the plane to remain uncovered, since that is the fraction of empty space left uncovered in the densest packing of disks. However, the regular octagon and smoothed octagon give counter-examples. It is conjectured that regular heptagons force the largest fraction of the plane to remain uncovered.[4] In dimensions four and above (excluding 8 and 24), the situation is complicated by the fact that the analogs of the Kepler conjecture remain open.

References[edit]

  1. ^ Gardner, Martin (1995). New Mathematical Diversions (Revised Edition). Washington: Mathematical Association of America. p. 251. 
  2. ^ de Graaf, Joost; van Roij, René; Dijkstra, Marjolein (2011), "Dense Regular Packings of Irregular Nonconvex Particles", Physical Review Letters, 107: 155501, arXiv:1107.0603Freely accessible, Bibcode:2011PhRvL.107o5501D, doi:10.1103/PhysRevLett.107.155501, PMID 22107298. 
  3. ^ Kallus, Yoav (2014), "The 3-ball is a local pessimum for packing", Advances in Mathematics, 264: 355, arXiv:1212.2551Freely accessible, doi:10.1016/j.aim.2014.07.015, MR 3250288. 
  4. ^ Kallus, Yoav (2015), "Pessimal packing shapes", Geometry & Topology, 19: 343, arXiv:1305.0289Freely accessible, doi:10.2140/gt.2015.19.343, MR 3318753.