
This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $\mathbb{H}^n$, for $n\geq 2$. For that purpose, the kissing number is replaced by the kissing function $��(n, r)$ which depends on the radius $r$. After we obtain some theoretical lower and upper bounds for $��(n, r)$, we study their asymptotic behaviour and show, in particular, that $\lim_{r\to \infty} \frac{\log ��(n,r)}{r} = n-1$. Finally, we compare them with the numeric upper bounds obtained by solving a suitable semidefinite program.
Will be merged with arXiv:1910.02715
Mathematics - Metric Geometry, Optimization and Control (math.OC), FOS: Mathematics, 05B40, 52C17, 51M09, Mathematics - Combinatorics, Metric Geometry (math.MG), Combinatorics (math.CO), Mathematics - Optimization and Control
Mathematics - Metric Geometry, Optimization and Control (math.OC), FOS: Mathematics, 05B40, 52C17, 51M09, Mathematics - Combinatorics, Metric Geometry (math.MG), Combinatorics (math.CO), Mathematics - Optimization and Control
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
