Related papers: Bounding the density of binary sphere packing
We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…
Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…
In this paper we study congruent and non-congruent hyperball (hypersphere) packings of the truncated regular octahedron and cube tilings. These are derived from the Coxeter simplex tilings $\{p,3,4\}$ $(7\le p \in \mathbb{N})$ and…
Hard spheres are ubiquitous in condensed matter: they have been used as models for liquids, crystals, colloidal systems, granular systems, and powders. Packings of hard spheres are of even wider interest, as they are related to important…
High strength-to-weight ratio materials can be constructed by either maximizing strength or minimizing weight. Tensegrity structures and aerogels take very different paths to achieving high strength-to-weight ratios but both rely on…
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…
Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize…
In order to study the fundamental limits of network densification, we look at the spatial spectral efficiency gain achieved when densely deployed communication devices embedded in the $d$-dimensional Euclidean space are optimally `matched'…
All hard, convex shapes are conjectured by Ulam to pack more densely than spheres, which have a maximum packing fraction of {\phi} = {\pi}/\sqrt18 ~ 0.7405. For many shapes, simple lattice packings easily surpass this packing fraction. For…
A binary fluid mixture of non-additive hard spheres characterized by a size ratio $\gamma=\sigma_2/\sigma_1<1$ and a non-additivity parameter $\Delta=2\sigma_{12}/(\sigma_1+\sigma_2)-1$ is considered in infinitely many dimensions. From the…
We use a two-level simulation method to analyse the critical point associated with demixing of binary hard sphere mixtures. The method exploits an accurate coarse-grained model with two-body and three-body effective interactions. Using this…
In this paper we study the blow-ups of the singular points in the boundary of a minimizing cluster lying in the interface of more than two chambers. We establish a sharp lower bound for the perimeter density at those points and we prove…
Density-based clustering methodology has been widely considered in the statistical literature for classifying Euclidean observations. However, this approach has not been contemplated for directional data yet. In this work, directional…
Employing numerical and theoretical methods, we investigate the structural characteristics of random sequential addition (RSA) of congruent spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$ in the infinite-time or saturation limit…
In 1993 Foisy et al. proved that the optimal Euclidean planar double bubble---the least-perimeter way to enclose and separate two given areas---is three circular arcs meeting at 120 degrees. We consider the plane with density $r^p$, joining…
Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for $E$-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is…
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…
The smallest maximum kissing-number Voronoi polyhedron of 3d spheres is the icosahedron and the tetrahedron is the smallest volume that can show up in Delaunay tessalation. No periodic lattice is consistent with either and hence these dense…
Define the superball with radius $r$ and center ${\boldsymbol 0}$ in $\mathbb{R}^n$ to be the set $$ \left\{{\boldsymbol x}\in\mathbb{R}^n:\sum_{j=1}^{m}\left(x_{k_j+1}^2+x_{k_j+2}^2+\cdots+x_{k_{j+1}}^2\right)^{p/2}\leq…