Related papers: A Densest ternary circle packing in the plane
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the…
In this paper we study congruent and non-congruent hyperball (hypersphere) packings of the truncated regular tetrahedron tilings. These are derived from the Coxeter simplex tilings $\{p,3,3\}$ $(7\le p \in \mathbb{N})$ and $\{5,3,3,3,3\}$…
We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…
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 present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…
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…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
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 exploration of the densest sphere packings is a fundamental problem in mathematics and a wide variety of sciences including materials science. We present our exhaustive computational exploration of the densest ternary sphere packings…
In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.
The note shows an easy way to improve E.H. Smith's packing density bound in $\mathbb{R}^3$ from $0.53835...$ to $0.54755...$ .
A compact metric ring containing the set of positive integers as dense subset is studied. It is proven that tis ring is isomorph with a ring of reminder classes of ring of polyadic integers.
We consider two seemingly unconnected problems: first, under what circumstances are arithmetic groups like SL(2,O) generated by elementary matrices; second, when do certain classes of circle/sphere packings fill up space? We show that these…
In two-dimensional rotating drum experiments, we find two separate influences of the packing fraction of a granular heap on its stability. For a fixed grain shape, the stability increases with packing fraction. However, in determining the…
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.…
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
A simple proof of Thue theorem on Circle Packing is given. The proof is only based on density analysis of Delaunay triangulation for the set of points that are centers of circles in a saturated circle configuration.
We adapt a construction of Klee (1981) to find a packing of unit balls in $\ell_p$ ($1\leq p<\infty$) which is efficient in the sense that enlarging the radius of each ball to any $R>2^{1-1/p}$ covers the whole space. We show that the value…