Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1003.3301

A method for dense packing discovery

Yoav Kallus·Veit Elser·Simon Gravel
View original source ↗Read source document ↗Export metadata ↓

Abstract

The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by analytic constructions, the importance of an efficient numerical method for conducting \textit{de novo} (from-scratch) searches for dense packings becomes crucial. In this paper, we use the \textit{divide and concur} framework to develop a general search method for the solution of periodic constraint problems, and we apply it to the discovery of dense periodic packings. An important feature of the method is the integration of the unit cell parameters with the other packing variables in the definition of the configuration space. The method we present led to improvements in the densest-known tetrahedron packing which are reported in [arXiv:0910.5226]. Here, we use the method to reproduce the densest known lattice sphere packings and the best known lattice kissing arrangements in up to 14 and 11 dimensions respectively (the first such numerical evidence for their optimality in some of these dimensions). For non-spherical particles, we report a new dense packing of regular four-dimensional simplices with density $ϕ=128/219\approx0.5845$ and with a similar structure to the densest known tetrahedron packing.

Explore related subjects

math.MGcond-mat.softcond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yoav Kallus, Veit Elser, Simon Gravel. 2010-08-04. A method for dense packing discovery. https://doi.org/10.1103/physreve.82.056707

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Godbersen's conjecture and the $L_p$-Rogers-Shephard inequality

We prove that the mixed volume of a convex body of fixed positive volume with its reflection about the origin is maximized by simplices. This confirms a conjecture of C. Godbersen from 1938 and refines the classical Rogers-Shephard inequality. We also prove that simplices are the only extremizers among convex polytopes. Finally, we use this inequality to prove an $L_p$-version of the Rogers-Shephard inequality for convex bodies containing the origin and show that, for any $p\in(1,\infty]$, the only extremizers are simplices with a vertex at the origin.

math.MG↗
arXiv2026

Tight Stability Estimates Near the Simplex and Applications for the Banach-Mazur Distance and Rogers-Shephard-Type Inequalities

We establish a tight stability estimate for the Minkowski asymmetry near its maximal value, improving earlier results in both the range for the admissible error and the strength of the estimate. More precisely, if an $n$-dimensional convex body $K$ has Minkowski asymmetry $s(K) \geq n-\varepsilon$ for $\varepsilon \in [0,1)$, then its Banach-Mazur distance to the $n$-simplex is at most \[ 1 + \varepsilon + \frac{\varepsilon^2}{2(1-\varepsilon)}. \] This dimension-independent estimate is sharp to the linear order in $\varepsilon$, including the constant. We apply this estimate to several problems. First, we prove a stability result for the maximal Banach-Mazur distance to the Euclidean ball, improving a previous estimate to the optimal linear order. As a key ingredient, we verify the conjecture that every convex body $K$ contains a translated copy of its volume-minimal circumscribed ellipsoid scaled down by a factor $\sqrt{n s(K)}$. Second, we prove a sharp common generalization of Schneider's higher-order Rogers-Shephard inequality and the $L_p$-Rogers-Shephard inequality, and establish a stability result of the optimal linear order. These results are based on the recent positive answer to the inequality part of the higher-order Godbersen conjecture and the accompanying proof of the $L_p$-Rogers-Shephard inequality. Finally, we improve upper bounds for the diameter of the Banach-Mazur compactum in fixed dimensions.

math.MG↗
arXiv2026

Busemann G-spaces with convex balls

We prove that any Busemann G-space such that every sufficiently small metric ball is convex is a topological manifold. The key ingredient in the proof is Ivanov's Helly theorem. The appendix contains a counterexample to a question of Berestovskii--Halverson--Repovš.

math.MG↗