Related papers: Hard sphere packings within cylinders
We present our exhaustive exploration of the densest ternary sphere packings (DTSPs) for 45 radius ratios and 237 kinds of compositions, which is a packing problem of three kinds of hard spheres with different radii, under periodic boundary…
We present the densest known packing of regular tetrahedra with density phi = 4000/4671 = 0.856347... Like the recently discovered packings of Kallus et al. [arXiv:0910.5226] and Torquato-Jiao [arXiv:0912.4210], our packing is crystalline…
Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize…
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…
Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the…
The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper…
The exploration of the densest sphere packings is a fundamental problem in mathematics and a wide variety of sciences including materials science. We present our exhaustive computational exploration of the densest ternary sphere packings…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…
The structural properties of dense random packings of identical hard spheres (HS) are investigated. The bond order parameter method is used to obtain detailed information on the local structural properties of the system for different…
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…
We investigate the morphologies and maximum packing density of thin wires packed into spherical cavities. Using simulations and experiments, we find that ordered as well as disordered structures emerge, depending on the amount of internal…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
We construct the densest known two-dimensional packings of superdisks in the plane whose shapes are defined by |x^(2p) + y^(2p)| <= 1, which contains both convex-shaped particles (p > 0.5, with the circular-disk case p = 1) and…
Hard sphere systems are often used to model simple fluids. The configuration spaces of hard spheres in a three-dimensional torus modulo various symmetry groups are comparatively simple, and could provide valuable information about the…
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…
We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
The densest binary sphere packings have historically been very difficult to determine. The only rigorously known packings in the alpha-x plane of sphere radius ratio alpha and relative concentration x are at the Kepler limit alpha = 1,…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…