A survey on the kissing numbers
classification
🧮 math.MG
keywords
kissingnumberscodesfindingnumberspheresphericalsurvey
read the original abstract
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in $n$ dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds for spherical codes and sphere packings. We survey old and recent results on the kissing numbers keeping the generality of spherical codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.