Densest local sphere-packing diversity: General concepts and application to two dimensions
arXiv:1002.0604 · doi:10.1103/PhysRevE.81.041305
Abstract
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of configuration space. Knowledge of Rmin(N) in d-dimensional Euclidean space allows for the construction both of a realizability condition for pair correlation functions of sphere packings and an upper bound on the maximal density of infinite sphere packings. In this paper, we focus on the two-dimensional circular disk problem. We find and present the putative densest packings and corresponding Rmin(N) for selected values of N up to N = 348 and use this knowledge to construct such a realizability condition and upper bound. We additionally analyze the properties and characteristics of the maximally dense packings, finding significant variability in their symmetries and contact networks, and that the vast majority differ substantially from the triangular lattice even for large N. Our work has implications for packaging problems, nucleation theory, and surface physics.
arXiv comment35 pages, 33 figures, 2 tables. Supporting material available at http://cherrypit.princeton.edu/
References in corpus (6)
- Is Random Close Packing of Spheres Well Defined?
- New upper bounds on sphere packings I
- Optimality and uniqueness of the Leech lattice among lattices
- Realizability of point processes
- Dense sphere packings from optimized correlation functions
- Spherical codes, maximal local packing density, and the golden ratio
Cited by in corpus (10)
- Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
- Basic Understanding of Condensed Phases of Matter via Packing Models
- Densest binary sphere packings
- Hard sphere packings within cylinders
- Local Number Fluctuations in Hyperuniform and Nonhyperuniform Systems: Higher-Order Moments and Distribution Functions
- Confined disordered strictly jammed binary sphere packings
- Densest local packing diversity. II. Application to three dimensions
- Extreme problems of circle packings on a sphere and irreducible contact graphs
- Enumeration of irreducible contact graphs on the sphere
- The maximum number of points in the cross-polytope that form a packing set of a scaled cross-polytope