Densest packings of translates of strings and layers of balls

arXiv1706.05282MaRDI QIDQ6287929FDOQ6287929

Authors: K. Böröczky, A. Heppes, E. jun. Makai 

Publication date: 16 June 2017

Abstract: Let $Lsubset{BbbR}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2din[2,2sqrt2]$. Then a packing of unit balls in ${BbbR}^3$ consisting of translates of $L$ has a density at most $pi/(3dsqrt3-d^2)$, with equality for a certain lattice packing of unit balls. Let $Lsubset{BbbR}^4$ be the union of unit balls, whose centres lie on the $x_3{x}_4$ coordinate plane, and form either a square lattice or a regular triangular lattice, of edge length $2$. Then a packing of unit balls in ${BbbR}^4$ consisting of translates of $L$ has a density at most $p{i}^2/16$, with equality for the densest lattice packing of unit balls in ${BbbR}^4$. This is the first class of non-lattice packings of unit balls in ${BbbR}^4$, for which this conjectured upper bound for the packing density of balls is proved. Our main tool for the proof is a theorem on $(r,R)$-systems in ${BbbR}^2$. If $R/rle2sqrt2$, then the Delone triangulation associated to this $(r,R)$-system has the following property. The average area of a Delone triangle is at least $min{V}_0,2r^2$, where $V_0$ is the infimum of the areas of the non-obtuse Delone triangles. This general theorem has applications also in other problems about packings: namely for $2r^{2}ge{V}_0$ it is sufficient to deal only with the non-obtuse Delone triangles, which is in general a much easier task. Still we give a proof of an unpublished theorem of L. Fejes T'oth and E (=J.) Sz'ekely: for the $2$-dimensional analogue of our question about equidistant strings of unit balls, we determine the densest packing of translates of an equidistant string of unit circles with distance $2d$, for the first non-trivial interval $2din(2sqrt3,4)$.

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

This page was built for publication: Densest packings of translates of strings and layers of balls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287929)