Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I am currently researching discrete geometry and I am in need of an upper bound on a generalized kissing number in 3-dimensions dependent upon a parameter $\eta$ which is the radii of spheres touching a central unit ball.

That is, center the unit ball $B \subset \mathbb{R}^3$ at the origin and define $k_{s}(\eta)$ to be the maximum number of balls of radius $\eta$ which can kiss $B$ and form a solid packing (non-overlapping interiors). How can you upper bound $k_{s}(\eta)$ for $\eta >0$? A remarkable case of note is $k_{s}(1) = 12$ which corresponds to the solution of the Newton-Gregory problem.

share|improve this question
1  
How sharp a bound do you need? Comparing volumes gives you one, but that is horribly far from the actual number. Might be enough for certain theoretical purposes though, depending on what you're doing. –  Achim Krause Mar 19 at 20:36
    
@AchimKrause: I am attempting to improve an upper bound regarding non-congruent sphere packings and need a bound which is as tight as possible; I'm not sure how I close need yet. I'm not sure what technique you intend to employ by comparing volumes. –  Samuel Reid Mar 19 at 20:37
    
Well, projecting the balls kissing B onto the surface of B gives a disjoint circles on the unit 2-sphere. By computing their area and comparing it to the total area, you obtain an upper bound. For example, in the $\eta=1$-case, this gives 16, which I think is way too bad for your purposes. –  Achim Krause Mar 19 at 20:53
3  
This is a duplicate (mathoverflow.net/questions/16879/…), you can get an equivalent of $k_s(\eta)$ when $\eta$ goes to $0$ from Anton Petrunin's answer. –  Benoît Kloeckner Mar 19 at 21:32
1  
@SamuelReid: my point is that this question being a duplicate, it should be discussed at the question mentionned above. –  Benoît Kloeckner Mar 20 at 14:14

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.