Related papers: Densest local packing diversity. II. Application t…
The isostatic jamming limit of frictionless spherical particles from Edwards' statistical mechanics [Song \emph{et al.}, Nature (London) {\bf 453}, 629 (2008)] is generalized to arbitrary dimension $d$ using a liquid-state description. The…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
A formalism is presented for analytically obtaining the probability density function, (P_{n}(s)), for the random distance (s) between two random points in an (n)-dimensional spherical object of radius (R). Our formalism allows (P_{n}(s)) to…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program…
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 aim of this paper is to review and discuss qualitatively some results on the properties of amorphous packings of hard spheres that were recently obtained by means of the replica method. The theory gives predictions for the equation of…
The densest amorphous packing of rigid particles is known as random close packing. It has long been appreciated that higher densities are achieved by using collections of particles with a variety of sizes. The variety of sizes is often…
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…
This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
We introduce a parameter space for periodic point sets, given as unions of $m$ translates of point lattices. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality.…
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…
Motivated by Guo-Luo's generalized circle packings on surfaces with boundary \cite{GL2}, we introduce the generalized Thurston's sphere packings on 3-dimensional manifolds with boundary. Then we investigate the rigidity of the generalized…
We study scale-invariant geometric quantities associated with embedded closed curves in Euclidean three-space, with an emphasis on their behavior under optimization within a fixed knot type. Given a Euclidean-invariant and scale-covariant…
We have recently devised organizing principles to obtain maximally dense packings of the Platonic and Archimedean solids, and certain smoothly-shaped convex nonspherical particles [Torquato and Jiao, Phys. Rev. E 81, 041310 (2010)]. Here we…
We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…