Related papers: New Sphere Packings from the Antipode Construction
We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical $\mathbb{Q}$-embedding of arbitrary number field $K$ into $\mathbb{R}^{[K:\mathbb{Q}]}$, both the prime ideal…
We study statistical and structural properties of extreme lattices, which are the local minima in the density landscape of lattice sphere packings, in $d$-dimensional Euclidean space $\mathbb{R}^d$. Specifically, we ascertain the…
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if completed, will jointly comprise a proof of the conjecture. We carry out step five of the program [outlined in math.MG/9811073], a proof…
Latin hypercube designs (LHDs) with space-filling properties are widely used for emulating computer simulators. Over the last three decades, a wide spectrum of LHDs have been proposed with space-filling criteria like minimum correlation…
We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
Particle size polydispersity can help to inhibit crystallization of the hard-sphere fluid into close-packed structures at high packing fractions and thus is often employed to create model glass-forming systems. Nonetheless, it is known that…
This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…
We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…
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…
We call a packing of hyperspheres in $n$ dimensions an Apollonian sphere packing if the spheres intersect tangentially or not at all; they fill the $n$-dimensional space; and every sphere in the packing is a member of a cluster of $n+2$…
It is commonly believed that the most efficient way to pack a finite number of equal-sized spheres is by arranging them tightly in a cluster. However, mathematicians have conjectured that a linear arrangement may actually result in the…
Spherical particles confined to a sphere surface cannot pack densely into a hexagonal lattice without defects. In this study, we use hard particle Monte Carlo simulations to determine the effects of continuously deformable shape anisotropy…
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…
We carry out a numerical study of the spinless modular bootstrap for conformal field theories with current algebra $U(1)^c \times U(1)^c$, or equivalently the linear programming bound for sphere packing in $2c$ dimensions. We give a more…
Jammed disordered packings of non-spherical particles show significant variation in the packing density as a function of particle shape for a given packing protocol. Rotationally symmetric elongated shapes such as ellipsoids,…
The Cohn-Elkies linear programming (LP) bound for sphere packing is known to be sharp in dimensions 8 and 24 but in no other dimension above 2. We investigate why by examining three independent necessary conditions for LP sharpness, drawn…
We present a new systematic approach to constructing spherical codes in dimensions $2^k$, based on Hopf foliations. Using the fact that a sphere $S^{2n-1}$ is foliated by manifolds $S_{\cos\eta}^{n-1} \times S_{\sin\eta}^{n-1}$,…
We prove the universal optimality of four remarkable spherical 11-designs in 48 dimensions either among all antipodal codes, or all spherical 3-designs, whose inner-products avoid the set $T_1=(-1/3,-1/6) \cup (1/6,1/3)$. We also prove the…
The rich variety of densest columnar structures of identical hard spheres inside a cylinder can surprisingly be constructed from a simple and computationally fast sequential deposition of cylinder-touching spheres, if the cylinder-to-sphere…