Contact numbers for congruent sphere packings in Euclidean 3-space

Abstract

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 finite family of non-overlapping unit balls) in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing elements touch each other. One of the most basic questions on contact graphs is to find the maximum number of edges that a contact graph of a packing of n unit balls can have in Euclidean 3-space. Our method for finding lower and upper estimates for the largest contact numbers is a combination of analytic and combinatorial ideas and it is also based on some recent results on sphere packings. Finally, we are interested also in the following more special version of the above problem. Namely, let us imagine that we are given a lattice unit sphere packing with the center points forming the lattice L in Euclidean 3-space (and with certain pairs of unit balls touching each other) and then let us generate packings of n unit balls such that each and every center of the n unit balls is chosen from L. Just as in the general case we are interested in finding good estimates for the largest contact number of the packings of n unit balls obtained in this way.

18 pages

Cited by in corpus (7)

• Sticky-sphere clusters
• Combinatorial distance geometry in normed spaces
• Density bounds for outer parallel domains of unit ball packings
• From canyons to valleys: Numerically continuing sticky hard sphere clusters to the landscapes of smoother potentials
• Kissing number in non-Euclidean spaces of constant sectional curvature
• General penny graphs are at most 43/18-dense
• Single-cell 3D genome reconstruction in the haploid setting using rigidity theory