Related papers: Rigidity of spherical codes
We algorithmically characterize the maximal contact number problem for finite congruent lattice sphere packings in $\mathbb{R}^d$ and show that in $\mathbb{R}^3$ this problem is equivalent to determining the maximal coordination of a…
We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal distance between such polytopes appears in complexity bounds…
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…
The average number of constraints per particle $< C_{total} >$ in mechanically stable systems of Platonic solids (except cubes) approaches the isostatic limit at the jamming point ($< C_{total} > \rightarrow 12$), though average number of…
Band structures are ubiquitous in condensed matter physics and their symmetries constrain possible degeneracies, topology and response functions across a broad range of different systems. Here we address the question: given a parent…
We numerically study the jamming transition of frictionless polydisperse spheres in three dimensions. We use an efficient thermalisation algorithm for the equilibrium hard sphere fluid and generate amorphous jammed packings over a range of…
Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
The best previous lower bounds for kissing numbers in dimensions 25 through 31 were constructed using a set $S$ with $|S| = 480$ of minimal vectors of the Leech Lattice, $\Lambda_{24}$, such that $\langle x, y \rangle \leq 1$ for any…
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…
We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…
An exact description of the complete jamming landscape is developed for a system of hard discs of diameter $\sigma$, confined between two lines separated by a distance $1+\sqrt{3/4} < H/\sigma < 2$. By considering all possible local packing…
Dynamical signatures are known to precede jamming in hard-particle systems, but static structural signatures have proven more elusive. The observation that compressing hard-particle packings towards jamming causes growing hyperuniformity…
At sufficiently low temperatures and high densities, repulsive spherical particles in two-dimensions (2d) form close-packed structures with six-fold symmetry. By contrast, when the interparticle interaction has an attractive anisotropic…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
In 2005, Wyart et al. (Europhys. Lett., 72 (2005) 486) showed that the low frequency vibrational properties of jammed amorphous sphere packings can be understood in terms of a length scale, called l*, that diverges as the system becomes…
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
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…
The local structure of disordered jammed packings of monodisperse spheres without friction, generated by the Lubachevsky-Stillinger algorithm, is studied for packing fractions above and below 64%. The structural similarity of the particle…