Densest packings of translates of strings and layers of balls

Abstract

Let L ⊂ R3 be the union of unit balls, whose centres lie on the z-axis, and are equidistant with distance 2d ∈ [2, 22]. Then a packing of unit balls in R3 consisting of translates of L has a density at most π /(3d3-d2), with equality for a certain lattice packing of unit balls. Let L ⊂ R4 be the union of unit balls, whose centres lie on the x3x4 coordinate plane, and form either a square lattice or a regular triangular lattice, of edge length 2. Then a packing of unit balls in R4 consisting of translates of L has a density at most π 2/16, with equality for the densest lattice packing of unit balls in R4. This is the first class of non-lattice packings of unit balls in R4, 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 R2. If R/r 2 2, then the Delone triangulation associated to this (r,R)-system has the following property. The average area of a Delone triangle is at least \ V0, 2r2 \ , where V0 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 2r2 V0 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 2d ∈ (23,4).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…