arXiv · 2411.16038
The Tammes Problem in $\mathbb{R}^{n}$ and Linear Programming Method
Abstract
The Tammes problem delves into the optimal arrangement of $N$ points on the surface of the $n$-dimensional unit sphere (denoted as $\mathbb{S}^{n-1}$), aiming to maximize the minimum distance between any two points. In this paper, we articulate the sufficient conditions requisite for attaining the optimal value of the Tammes problem for arbitrary $n, N \in \mathbb{N}^{+}$, employing the linear programming framework pioneered by Delsarte et al. Furthermore, we showcase several illustrative examples across various dimensions $n$ and select values of $N$ that yield optimal configurations. The findings illuminate the intricate structure of optimal point distributions on spheres, thereby enriching the existing body of research in this domain.
Explore related subjects
Keep this discovery
Yanlu Lian, Qun Mo, Yu Xia. 2024-11-25. The Tammes Problem in $\mathbb{R}^{n}$ and Linear Programming Method. https://arxiv.org/abs/2411.16038
Cite the original work for its findings. Save a collection to share your selection of sources.