Maximally random jammed (MRJ) sphere packing is a prototypical example of a system naturally poised at the margin between underconstraint and overconstraint. This marginal stability has traditionally been understood in terms of isostaticity, the equality of the number of mechanical contacts and the number of degrees of freedom. Quasicontacts, pairs of spheres on the verge of coming in contact, are irrelevant for static stability, but they come into play when considering dynamic stability, as does the distribution of contact forces. We show that the effects of marginal dynamic stability, as manifested in the distributions of quasicontacts and weak contacts, are consequential and nontrivial. We study these ideas first in the context of MRJ packing of d-dimensional spheres, where we show that the abundance of quasicontacts grows at a faster rate than that of contacts. We reexamine a calculation of Jin et al. [Phys. Rev. E 82, 051126 (2010)], where quasicontacts were originally neglected, and we explore the effect of their inclusion in the calculation. This analysis yields an estimate of the asymptotic behavior of the packing density in high dimensions. We argue that this estimate should be reinterpreted as a lower bound. The latter part of the paper is devoted to Bravais lattice packings that possess the minimum number of contacts to maintain mechanical stability. We show that quasicontacts play an even more important role in these packings. We also show that jammed lattices are a useful setting for studying the Edwards ensemble, which weights each mechanically stable configuration equally and does not account for dynamics. This ansatz fails to predict the power-law distribution of near-zero contact forces, P(f)~f^θ.

We generate and study an ensemble of isostatic jammed hard-sphere lattices. These lattices are obtained by compression of a periodic system with an adaptive unit cell containing a single sphere until the point of mechanical stability. We present detailed numerical data about the densities, pair correlations, force distributions, and structure factors of such lattices. We show that this model retains many of the crucial structural features of the classical hard-sphere model and propose it as a model for the jamming and glass transitions that enables exploration of much higher dimensions than are usually accessible.

We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond previous methods, not only in exploring higher dimensions but also in shedding light on the statistical mechanics underlying the problem in question. We observe evidence of a phase transition in the thermodynamic limit d➝∞. In the dimensions explored in the present work, the results are consistent with a first-order crystallization transition but leave open the possibility that a glass transition is manifested in higher dimensions.

Aristotle contended that (regular) tetrahedra tile space, an opinion that remained widespread until it was observed that non-overlapping tetrahedra cannot subtend a solid angle of 4π around a point if this point lies on a tetrahedron edge. From this 15th century argument, we can deduce that tetrahedra do not tile space but, more than 500 years later, we are unaware of any known non-trivial upper bound to the packing density of tetrahedra. In this article, we calculate such a bound. To this end, we show the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is not fully covered by the packing. The bound on the amount of space that is not covered in each sphere is obtained in a recursive way by building on the solid angle argument. The argument can be readily modified to apply to other polyhedra. The resulting lower bound on the fraction of empty space in a packing of regular tetrahedra is 2.6…×10⁻²⁵ and reaches 1.4…×10⁻¹² for regular octahedra.

We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction 100/117≈0.8547, that are simple in the sense that they are transitive and their repeating units involve only four tetrahedra. The construction of the packings was inspired from results of a numerical search that yielded a similar packing. We present an analytic construction of the packings and a description of their properties. We also present a transitive packing with a repeating unit of two tetrahedra and a packing fraction (139+40√10)/369≈0.7194.