Related papers: Bounding the density of binary sphere packing
We construct a dense packing of regular tetrahedra, with packing density $D > >.7786157$.
This paper describes the local density inequality approach to getting upper bounds for sphere packing densities in R^n. This approach was first suggested by L. Fejes-Toth in 1956 to prove the Kepler conjecture that the densest sphere…
We show that every packing of congruent regular pentagons in the Euclidean plane has density at most $(5-\sqrt5)/3$, which is about 0.92. More specifically, this article proves the pentagonal ice-ray conjecture of Henley (1986), and…
In this paper, the binary random packing fraction of similar particles with size ratios ranging from unity to well over 2 is studied. The classic excluded volume model for spherocylinders and cylinders proposed by Onsager [1] is revisited…
According to the latest evidence, the Universe is entering an era of exponential expansion, where gravitationally bound structures will get disconnected from each other, forming isolated `island universes'. In this scenario, we present a…
Bead packs of up to 150,000 mono-sized spheres with packing densities ranging from 0.58 to 0.64 have been studied by means of X-ray Computed Tomography. These studies represent the largest and the most accurate description of the structure…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…
What particle shape will generate the highest packing fraction when randomly poured into a container? In order to explore and navigate the enormous search space efficiently, we pair molecular dynamics simulations with artificial evolution.…
We describe a program to prove the Kepler conjecture on sphere packings. We then carry out the first step of this program. Each packing determines a decomposition of space into Delaunay simplices, which are grouped together into finite…
A divide is the image of a proper and generic immersion of a compact $1$-manifold into the $2$-disk. Due to A'Campo's theory, each divide is associated with a link in the 3-sphere. In this paper, we reveal a hidden hyperbolic structure in…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
Motivated by the relation between particle shape and packing, we measure the volume fraction $\phi$ occupied by the Platonic solids which are a class of polyhedron with congruent sides, vertices and dihedral angles. Tetrahedron, cube,…
It has been recently pointed out by Farr and Groot (arXiv:0912.0852) and by Kyrylyuk and Philipse (Prog. Colloid Polym. Sci., 2010, in press) that our theoretical result for the jamming density of a binary mixture of hard spheres…
We present a new lower bound on the Bowen-Radin maximal density of radius-R ball packings in the m-dimensional hyperbolic space, improving on the basic covering bound by factor \Omega(m(R+\ln m)) as m tends to infinity. This is done by…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
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)$,…
A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…