Kissing number in spherical space
Abstract
This paper investigates the behaviour of the kissing number (n, r) of congruent radius r > 0 spheres in Sn, for n≥ 2. Such a quantity depends on the radius r, and we plot the approximate graph of (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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.