Related papers: A formulation of the Kepler conjecture
The densest binary sphere packings have historically been very difficult to determine. The only rigorously known packings in the alpha-x plane of sphere radius ratio alpha and relative concentration x are at the Kepler limit alpha = 1,…
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…
We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
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…
The rich variety of densest columnar structures of identical hard spheres inside a cylinder can surprisingly be constructed from a simple and computationally fast sequential deposition of cylinder-touching spheres, if the cylinder-to-sphere…
Thurston's sphere packing on a 3-dimensional manifold is a generalization of Thusrton's circle packing on a surface, the rigidity of which has been open for many years. In this paper, we prove that Thurston's Euclidean sphere packing is…
We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…
Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the…
This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
After the investigation of the congruent and non-congruent hyperball packings related to doubly truncated Coxeter orthoscheme tilings \cite{SzJ1}, we consider the corresponding covering problems. In \cite{MSSz} the authors gave a partial…
Packings of equal disks in the plane are known to have density at most $\pi/\sqrt{12}$, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a…
Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…
The packing of hard spheres (HS) of diameter $\sigma$ in a cylinder has been used to model experimental systems, such as fullerenes in nanotubes and colloidal wire assembly. Finding the densest packings of HS under this type of confinement,…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…
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…
Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…