Related papers: Locally optimal 2-periodic sphere packings
We study locality-sensitive hash methods for the nearest neighbor problem for the angular distance, focusing on the approach of first projecting down onto a low-dimensional subspace, and then partitioning the projected vectors according to…
We have formulated the problem of generating periodic dense paritcle packings as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the…
For a lattice/linear code, we define the Voronoi spherical cumulative density function (CDF) as the CDF of the $\ell_2$-norm/Hamming weight of a random vector uniformly distributed over the Voronoi cell. Using the first moment method…
This paper applies techniques from algebraic and differential geometry to determine how to best pack points in real projective spaces. We present a computer-assisted proof of the optimality of a particular 6-packing in…
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…
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our…
The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment $G$. In dimensions $1$ to $8$, it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence…
The Voronoi cell of any atom in a lattice is identical. If atoms are perturbed from their lattice coordinates, then the topologies of the Voronoi cells of the atoms will change. We consider the distribution of Voronoi cell topologies in…
Given a set of $n$ sites from $\mathbb{R}^d$, each having some positive weight factor, the Multiplicatively Weighted Voronoi Diagram is a subdivision of space that associates each cell to the site whose weighted Euclidean distance is…
Connecting the collective behavior of disordered systems with local structure on the particle scale is an important challenge, for example in granular and glassy systems. Compounding complexity, in many scientific and industrial…
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining…
We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ of density $\Theta(d \cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
Jamming in hard-particle packings has been the subject of considerable interest in recent years. In a paper by Torquato and Stillinger [J. Phys. Chem. B, 105 (2001)], a classification scheme of jammed packings into hierarchical categories…
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…
The hyperuniformity concept provides a unified means to classify all perfect crystals, perfect quasicrystals, and exotic amorphous states of matter according to their capacity to suppress large-scale density fluctuations. While the…
In the first paper of this series, we introduced Voronoi correlation functions to characterize the structure of maximally random jammed (MRJ) sphere packings across length scales. In the present paper, we determine a variety of correlation…
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…
In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. This asymptotic lower bound improves on previous asymptotic bounds by a constant factor and improves not just lower bounds for…