Related papers: Sphere packings II
This review paper is devoted to the problems of sphere packings in 4 dimensions. The main goal is to find reasonable approaches for solutions to problems related to densest sphere packings in 4-dimensional Euclidean space. We consider two…
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.
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…
Saturated random packing of particles built of two identical, relatively shifted spheres in two and three dimensional flat and homogeneous space was studied numerically using random sequential adsorption algorithm. The shift between centers…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
Sequentially-built random sphere-packings have been numerically studied in the packing fraction interval $0.329 < \gamma < 0.586$. For that purpose fast running geometrical algorithms have been designed in order to build about 300…
In this note we consider the problem of manufacturing a convex polyhedral object via casting. We consider a generalization of the sand casting process where the object is manufactured by gluing together two identical faces of parts cast…
We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell…
We study the hard-core model of statistical mechanics on a unit cubic lattice $\mathbb{Z}^3$, which is intrinsically related to the sphere-packing problem for spheres with centers in $\mathbb{Z}^3$. The model is defined by the sphere…
In \cite{Sz17-2} we proved that to each saturated congruent hyperball packing exists a decomposition of $3$-dimensional hyperbolic space $\mathbb{H}^3$ into truncated tetrahedra. Therefore, in order to get a density upper bound for…
While granular segregation in partially filled containers has been studied extensively, granular dynamics in densely filled spheres is not fully understood. Here, surface band segregation and granular convection are reported in a rotating…
Polydisperse mixtures are those in which components with a whole range of sizes are present. It is shown that the fluid phase of polydisperse hard spheres is thermodynamically unstable unless the density of large spheres decreases at least…
For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
The formation of quasi-spherical cages from protein building blocks is a remarkable self-assembly process in many natural systems, where a small number of elementary building blocks are assembled to build a highly symmetric icosahedral…
The setting for this brief paper is R^3. Distance between two spheres is understood as distance delta between spherical centers. For instance, a Reuleaux tetrahedron T is the intersection of four unit balls satisfying delta=1 pairwise.…
We have previously explored cylindrical packings of disks and their relation to sphere packings. Here we extend the analytical treatment of disk packings, analysing the rules for phyllotactic indices of related structures and the variation…