Sphere packing
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
s In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalized to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions, or hypersphere packing in higher dimensions) or to non-Euclidean spaces such as hyperbolic space. A typical sphere packing problem is to find an arrangement where the spheres fill as much of the space as possible. The proportion of space filled by the spheres is called the packing density of the arrangement. As the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume. For equal spheres in three dimensions, the densest packing uses approximately 74% of the volume. A random packing of equal spheres generally has a density around 63.5%.
s In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalized to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions, or hypersphere packing in higher dimensions) or to non-Euclidean spaces such as hyperbolic space. A typical sphere packing problem is to find an arrangement where the spheres fill as much of the space as possible. The proportion of space filled by the spheres is called the packing density of the arrangement. As the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume. For equal spheres in three dimensions, the densest packing uses approximately 74% of the volume. A random packing of equal spheres generally has a density around 63.5%. \alpha^* = \frac{1}{2} \log_2\left(\frac{2\pi}{e}\right) \approx 0.60440. The claimed proof was obtained using their then-unreleased Astra model. It resolved a 2020 conjecture of Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini, by establishing the exact asymptotic decay rate \lim_{n \to \infty} (\operatorname{LP}_n)^{1/n} = \sqrt{e/(2\pi)} of the Cohn–Elkies linear program, proving that \alpha^* is the exact barrier of the linear programming method.
Unequal sphere packing
Many problems in the chemical and physical sciences can be related to packing problems where more than one size of sphere is available. Here there is a choice between separating the spheres into regions of close-packed equal spheres, or combining the multiple sizes of spheres into a compound or interstitial packing. When many sizes of spheres (or a distribution) are available, the problem quickly becomes intractable, but some studies of binary hard spheres (two sizes) are available. When the second sphere is much smaller than the first, it is possible to arrange the large spheres in a close-packed arrangement, and then arrange the small spheres within the octahedral and tetrahedral gaps. The density of this interstitial packing depends sensitively on the radius ratio, but in the limit of extreme size ratios, the smaller spheres can fill the gaps with the same density as the larger spheres filled space. Even if the large spheres are not in a close-packed arrangement, it is always possible to insert some smaller spheres of up to of the radius of the larger sphere. When the smaller sphere has a radius greater than of the radius of the larger sphere, it is no longer possible to fit into even the octahedral holes of the close-packed structure. Thus, beyond this point, either the host structure must expand to accommodate the interstitials (which compromises the overall density), or rearrange into a more complex crystalline compound structure. Structures are known that exceed the close packing density for radius ratios up to . Upper bounds for the density that can be obtained in such binary packings have also been obtained using a continuous analog of the sum of squares hierarchy of semidefinite programs. For many chemical structures such as ionic crystals, their stoichiometry is constrained by the charges of the constituent ions. This additional constraint on the packing, together with the need to minimize the Coulomb energy of interacting charges, leads to a diversity of optimal packing arrangements. The upper bound for the density of a strictly jammed sphere packing with any set of radii is 1 an example of such a packing of spheres is the Apollonian sphere packing. The lower bound for such a sphere packing is 0 an example is the Dionysian sphere packing.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1375259008 under CC BY-SA 4.0; modifications have been made.