Related papers: The Antipode Construction for Sphere Packings
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
Any space-filling packing of spheres can be cut by a plane to obtain a space-filling packing of disks. Here, we deal with space-filling packings generated using inversive geometry leading to exactly self-similar fractal packings. First, we…
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat…
Most of the calculations in standard sphere decoders are redundant, in the sense that they either calculate quantities that are never used or calculate some quantities more than once. A new method, which is applicable to lattices as well as…
In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how these structured constellations…
Disordered stealthy hyperuniform (SHU) packings are an emerging class of exotic amorphous two-phase materials endowed with novel physical properties. Such packings of identical spheres have been created from SHU point patterns via a…
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$…
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 give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
A new class of spherical codes is constructed by selecting a finite subset of flat tori from a foliation of the unit sphere S^{2L-1} of R^{2L} and designing a structured codebook on each torus layer. The resulting spherical code can be the…
We explain in some detail the geometric structure of spheres in any dimension. Our approach may be helpful for other homogeneous spaces (with other signatures) such as the de Sitter and anti-de Sitter spaces. We apply the procedure to the…
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…
Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…
The formation of quasi-spherical cages from protein building blocks is a remarkable self-assembly process in many natural systems, where a small number of elementary building blocks are assembled to build a highly symmetric icosahedral…
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 show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
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 introduce the notion of a "crystallographic sphere packing," defined to be one whose limit set is that of a geometrically finite hyperbolic reflection group in one higher dimension. We exhibit for the first time an infinite family of…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…