相关论文: Sphere packings III

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…

We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…

We present the first study of disordered jammed hard-sphere packings in four-, five- and six-dimensional Euclidean spaces. Using a collision-driven packing generation algorithm, we obtain the first estimates for the packing fractions of the…

We prove that the space of circle packings consistent with a given triangulation on a surface of genus at least two is projectively rigid, so that a packing on a complex projective surface is not deformable within that complex projective…

The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…

The sintering behavior of close packed spheres is investigated using a numerical model. The investigated systems are the body centered cubic (BCC), face centered cubic (FCC) and hexagonal closed packed spheres (HCP). The sintering behavior…

After having investigated the regular prisms and prism tilings in the $\SLR$ space in the previous work \cite{Sz13-1} of the second author, we consider the problem of geodesic ball packings related to those tilings and their symmetry groups…

It is well known that the lattice packing density and the lattice covering density of a triangle are $\frac{2}{3}$ and $\frac{3}{2}$ respectively. We also know that the lattices that attain these densities both are unique. Let…

Although the concept of random close packing with an almost universal packing fraction of ~ 0.64 for hard spheres was introduced more than half a century ago, there are still ongoing debates. The main difficulty in searching the densest…

For each k >= 1 and corresponding hexagonal number h(k) = 3k(k+1)+1, we introduce m(k) = max[(k-1)!/ 2, 1] packings of h(k) equal disks inside a circle which we call "the curved hexagonal packings". The curved hexagonal packing of 7 disks…

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…

In this paper we generalize the classical theorem of Thue about the optimal circular disc packing in the plane. We are given a family of circular discs, not necessarily of equal radii, with the property that the inflation of every disc by a…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…

Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…

In this paper, we study the problem of hyperball (hypersphere) packings in $n$-dimensional hyperbolic space ($n \ge 4$). We prove that to each $n$-dimensional congruent saturated hyperball packing, there is an algorithm to obtain a…

For the binary discs packed in two dimensions, the packing fraction of disc assembly becomes lower than that of the monodisperse system when the size ratio is close to unity. We show that the suppressed packing fraction is caused by an…

Random packing of spheres inside fractal collectors of dimension 2 < d < 3 is studied numerically using Random Sequential Adsorption (RSA) algorithm. The paper focuses mainly on the measurement of random packing saturation limit.…

We produce a family of bodies in $\mathbb R^3$ parameterized by $\varepsilon > 0$, each bounded by a smooth topological sphere with principal curvatures in $[-1, 1]$, and having volume arbitrarily close to $ 16 - 4\sqrt 3 + \left(10 \sqrt 3…

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…