Deriving Finite Sphere Packings
arXiv:1011.5412 · doi:10.1137/100784424
Abstract
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for deriving all packings of n spheres in R^3 satisfying minimal rigidity constraints (>= 3 contacts per sphere and >= 3n-6 total contacts). We derive such packings for n <= 10, and provide a preliminary set of maximal contact packings for 10 < n <= 20. The resultant set of packings has some striking features, among them: (i) all minimally rigid packings for n <= 9 have 3n-6 contacts, (ii) non-rigid packings satisfying minimal rigidity constraints arise for n >= 9, (iii) the number of ground states (i.e. packings with the maximal number of contacts) oscillates with respect to n, (iv) for 10 <= n <= 20 there are only a small number of packings with the maximal number of contacts, and for 10 <= n < 13 these are all commensurate with the HCP lattice. The general method presented here may have applications to other related problems in mathematics, such as the Erdos repeated distance problem and Euclidean distance matrix completion problems.
arXiv commentThe updates that have been made to version II are as follows: (i) some updates to the main text have been made, primarily correcting the number of packings reported in PRL, 103, 118303 and in version I of this paper for n = 9,10. (ii) The supplemental information for the paper has been included
References in corpus (4)
Cited by in corpus (22)
- A geometrical approach to computing free energy landscapes from short-ranged potentials
- Two-Dimensional Clusters of Colloidal Spheres: Ground States, Excited States, and Structural Rearrangements
- Enumerating rigid sphere packings
- Structure of finite sphere packings via exact enumeration: Implications for colloidal crystal nucleation
- Complexity in surfaces of densest packings for families of polyhedra
- From Sticky-Hard-Sphere to Lennard-Jones-Type Clusters
- Sticky-sphere clusters
- Structure and dynamics of model colloidal clusters with short-range attractions
- Free energy of singular sticky-sphere clusters
- Physical interpretation of the partition function for colloidal clusters
- Electronic and magnetic properties of Co_n Mo_m nanoclusters with n+m = x and 2<=x<=6 atoms from DFT calculations
- Accessing Semi-Addressable Self Assembly with Efficient Structure Enumeration
- Brownian dynamics simulations of sphere clusters in optical tweezers
- A Graph-Algorithmic Approach for the Study of Metastability in Markov Chains
- The Gregory-Newton Problem for Kissing Sticky Spheres
- The polyhedral structure underlying programmable self-assembly
- On Contact Numbers of Finite Lattice Sphere Packings and the Maximal Coordination of Monatomic Crystals
- From canyons to valleys: Numerically continuing sticky hard sphere clusters to the landscapes of smoother potentials
- On contact graphs of totally separable domains
- Self-assembling kinetics: Accessing a new design space via differentiable statistical-physics models
- Extreme problems of circle packings on a sphere and irreducible contact graphs
- On Arrangements of Six, Seven, and Eight Spheres: Maximal Bonding of Monatomic Ionic Compounds