2000 character limit reached
Kissing number in spherical space (1910.02715v2)
Published 7 Oct 2019 in math.MG, math.CO, and math.OC
Abstract: This paper investigates the behaviour of the kissing number $\kappa(n, r)$ of congruent radius $r > 0$ spheres in $\mathbb{S}n$, for $n\geq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $\kappa(n, r)$ with relatively high accuracy by using new upper and lower bounds that are produced via semidefinite programming and by using spherical codes, respectively.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.