
> 
> In geometry, a [kissing number](https://en.wikipedia.org/wiki/Kissing_number_problem) is defined as the number of
>  non-overlapping unit spheres that can be arranged such that they each
>  touch another given unit sphere.
> 
> 
> 


Let $\tau\_n$ be the kissing number in $n$ dimensions. Kabatiansky and Levenshtein proved the following *asymptotic* upper bound ([ppi1518](http://mi.mathnet.ru/eng/ppi1518), [mr514023](http://www.ams.org/mathscinet-getitem?mr=514023), 1978): $$\tau\_n \le 2^{0.401n(1+o(1))} = (1.32\dots)^{n(1+o(1))}$$


**Question**: What is the smallest $\alpha$ such that $\tau\_n \le \alpha^n$, for all $n$?  

($\alpha := \min\_{n \ge 1} \tau\_n^{1/n}$)


By using volume, we can prove that $\tau\_n \le \frac{Vol(B(3))-Vol(B(1))}{Vol(B(1))}=3^n-1$, so $\alpha \le 3$.


Now $\tau\_2 = 6$, so $\alpha \ge \sqrt 6 \simeq 2.45$. Moreover, for $n \le 24$, $\tau\_n^{1/n} \le \sqrt 6$. Is it true that $\alpha = \sqrt 6$? 


This post is motivated by [arXiv:1710.00285](https://arxiv.org/pdf/1710.00285.pdf), Section 5. 



Upper bound of the kissing number in n dimensions
It’s almost certainly true, and provable, that $\alpha=\sqrt{6}$, although I haven’t worked out the details rigorously. Kabatiansky and Levenshtein give an exact upper bound (not just an asymptotic expression), which is equation (52) in their paper. Numerical calculations indicate that it improves on $\sqrt{6}$ in dimensions 8 and higher, while other kissing bounds cover dimensions 3 through 7 (see Chapter 1 of Conway and Sloane). So all one has to do is prove this inequality for the Kabatianski-Levenshtein bound in dimensions 8 and up. It suffices to prove an asymptotic bound with explicit constants to handle high dimensions, and then check any remaining dimensions not covered by that bound. I haven’t worked it out, but standard techniques should suffice to do this. (I.e., there’s nothing ineffective about the bounds, so one can obtain explicit constants.) This approach looks ugly and tedious enough that I haven’t worked up the energy to actually do it, but it should work in principle. The main technical input needed is explicit bounds for the largest roots of Gegenbauer polynomials.


