SIAM Journal on Discrete Mathematics · 2011 · 56 citations · 37 references
Natural SciencesMathematicsCombinatoricsComputational GeometryCrystal StructureAtomic PackingClose-packed StructuresFinite GeometryGround StatesPacking ProblemsSphere Packing
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 $\mathbb{R}^3$ satisfying minimal rigidity constraints ($\geq 3$ contacts per sphere and $\geq 3n-6$ total contacts). We derive such packings for $n \leq 10$ and provide a preliminary set of maximum contact packings for $10 < n \leq 20$. The resultant set of packings has some striking features; among them are the following: (i) all minimally rigid packings for $n \leq 9$ have exactly $3n-6$ contacts; (ii) nonrigid packings satisfying minimal rigidity constraints arise for $n \geq 9$; (iii) the number of ground states (i.e., packings with the maximum number of contacts) oscillates with respect to n; (iv) for $10 \leq n \leq 20$ there are only a small number of packings with the maximum number of contacts, and for $10 \leq n < 13$ these are all commensurate with the hexagonal close-packed lattice. The general method presented here may have applications to other related problems in mathematics, such as the Erdös repeated distance problem and Euclidean distance matrix completion problems.
37
George M. Whitesides, Bartosz A. Grzybowski · Science · 2002 · 7.4K citations
Atomic packing and short-to-medium-range order in metallic glasses
H. W. Sheng, Weiqi Luo, Faisal M. Alamgir et al. · Nature · 2006 · 2.1K citations
Practical graph isomorphism, II
Brendan D. McKay, Adolfo Piperno · Journal of Symbolic Computation · 2013 · 1.6K citations
Dense Packing and Symmetry in Small Clusters of Microspheres
Vinothan Manoharan, Mark T. Elsesser, David J. Pine · Science · 2003 · 1.1K citations