Average kissing numbers for non-congruent sphere packings

Details Average kissing numbers for non-congruent sphere packings Average kissing numbers for non-congruent sphere packings

1994-05-13

arxiv.org/abs/math/9405218v1

Math.Res.Lett.1:339-344,1994

Mathematics

Metric Geometry

6 pages

Scientific paper

The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3 as a first restriction on the possible nerves of such packings. We show that the supremum k of the average kissing number for all packings satisfies 12.566 ~ 666/53 <= k < 8 + 4*sqrt(3) ~ 14.928 We obtain the upper bound by a resource exhaustion argument and the upper bound by a construction involving packings of spherical caps in S^3. Our result contradicts two naive conjectures about the average kissing number: That it is unbounded, or that it is supremized by an infinite packing of congruent spheres.

Affiliated with

Also associated with

No associations

Rating

Average kissing numbers for non-congruent sphere packings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Average kissing numbers for non-congruent sphere packings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average kissing numbers for non-congruent sphere packings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540779