This paper investigates the behaviour of the kissing number $κ(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 $κ(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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。