Related papers: Remarks on soft ball packings in dimensions 2 and …
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…
This is the second in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
The structural properties of packed soft-core particles provide a platform to understand the cross-pollinated physical concepts in solid-state- and soft-matter physics. Confined on spherical surface, the traditional differential geometry…
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…
In \cite{Sz11} we have generalized the notion of the simplicial density function for horoballs in the extended hyperbolic space $\bar{\mathbf{H}}^n, ~(n \ge 2)$, where we have allowed {\it congruent horoballs in different types} centered at…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
By studying the volume of a generalized difference body, this paper presents the first nontrivial lower bound for the lattice covering density by $n$-dimensional simplices.
We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…
We describe a theory of packing hyperboloid 'diabolic' domains in bend-free textures of liquid crystals. The domains sew together continuously, providing a menagerie of bend-free textures akin to the packing of focal conic domains in…
We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…
In this note, we observe that if $B$ is a ball in a Euclidean space with dimension $n$, $n\geq3$, then a stable CMC hypersurface $\Sigma$ with free boundary in $B$ satisfies \[ nA\leq L\leq nA\left( \frac{1+\sqrt{1+4(n+1)H^2}}{2} \right)\,,…
Particle packing problems have fascinated people since the dawn of civilization, and continue to intrigue mathematicians and scientists. Resurgent interest has been spurred by the recent proof of Kepler's conjecture: the face-centered cubic…
The Nil geometry, which is one of the eight 3-dimensional Thurston geometries, can be derived from {W. Heisenberg}'s famous real matrix group. The aim of this paper to study {\it lattice coverings} in Nil space. We introduce the notion of…
We investigate the structural, vibrational, and mechanical properties of jammed packings of deformable particles with shape degrees of freedom in three dimensions (3D). Each 3D deformable particle is modeled as a surface-triangulated…
In this paper I will approach the computation of the maximum density of regular lattices in large dimensions using a statistical mechanics approach. The starting point will be some theorems of Roger, which are virtually unknown in the…
We give a complete characterization of all isoperimetric sets contained in a domain of the Euclidean plane, that is bounded by a Jordan curve and satisfies a no-neck property. Further, we prove that the isoperimetric profile of such domain…
The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has…
Discrete simulation methods are efficient tools to investigate the complex behaviors of complex fluids made of either dry granular materials or dilute suspensions. By contrast, materials made of soft and/or concentrated units (emulsions,…
Let $X$ be a convex co-compact hyperbolic surface and let $\delta$ be the Hausdorff dimension of the limit set of the underlying discrete group. We show that the density of the resonances of the Laplacian in strips ${\sigma\leq \re(s) \leq…