Related papers: Optimal Packings of Superballs
Unraveling the complexities of random packing in three dimensions has long puzzled physicists. While both experiments and simulations consistently show a maximum density of 64 percent for tightly packed random spheres, we still lack an…
We give upper bounds for the density of unit ball packings relative to their outer parallel domains and discuss their connection to contact numbers. Also, packings of soft balls are introduced and upper bounds are given for the fraction of…
The study of hard-particle packings is of fundamental importance in physics, chemistry, cell biology, and discrete geometry. Much of the previous work on hard-particle packings concerns their densest possible arrangements. By contrast, we…
A stochastic PDE, describing mesoscopic fluctuations in systems of weakly interacting inertial particles of finite volume, is proposed and analysed in any finite dimension $d\in\mathbb{N}$. It is a regularised and inertial version of the…
Understanding the relationship between colloidal building block shape and self-assembled material structure is important for the development of novel materials by self-assembly. In this regard, colloidal superballs are unique building…
Continuing on recent computational and experimental work on jammed packings of hard ellipsoids [Donev et al., Science, vol. 303, 990-993] we consider jamming in packings of smooth strictly convex nonspherical hard particles. We explain why…
An external load on a particle packing is distributed internally through a heterogeneous network of particle contacts. This contact force distribution determines the stability of the particle packing and the resulting structure. Here, we…
We present the densest known packing of regular tetrahedra with density phi = 4000/4671 = 0.856347... Like the recently discovered packings of Kallus et al. [arXiv:0910.5226] and Torquato-Jiao [arXiv:0912.4210], our packing is crystalline…
Dense packings of nonoverlapping bodies in three-dimensional Euclidean space are useful models of the structure of a variety of many-particle systems that arise in the physical and biological sciences. Here we investigate the packing…
The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…
The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than $\pi/\sqrt{18}$. A computer assisted verification confirmed this conjecture in 1998. This article gives a historical…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Recent LLM-driven discoveries have renewed interest in geometric packing problems. In this paper, we study several classes of such packing problems through the lens of modern global nonlinear optimization. Starting from comparatively direct…
We consider ternary disc packings of the plane, i.e. the packings using discs of three different radii. Packings in which each ''hole'' is bounded by three pairwise tangent discs are called triangulated. There are 164 pairs $(r,s)$,…
Based on results from the physics and mathematics literature which suggest a series of clearly defined conjectures, we formulate three simple scenarios for the fate of hard sphere crystallization in high dimension: (A) crystallization is…
We use a mesoscale simulation approach to explore the impact of different capsid geometries on the packaging and ejection dynamics of polymers of different flexibility. We find that both packing and ejection times are faster for flexible…
Sought-after ordered structures of mixtures of hard anisotropic nanoparticles can often be thermodynamically unfavorable due to the components' geometric incompatibility to densely pack into regular lattices. A simple compatibilization rule…
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 many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications…