Abstract.
The central question of this paper is the following somewhat more general version of the well-known Tammes problem, which we call the polyhedral Tammes problem. For given integers \(n\geqq d+1\geqq 3\) find the maximum of the shortest distance between any two of the n vertices of a convex d-polytope with diameter 1 in E d. We study this question for large n, as well as for some small values of n for fixed d.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 19.8.1999
Rights and permissions
About this article
Cite this article
Bezdek, K., Blekherman, G., Connelly, R. et al. The polyhedral Tammes problem. Arch. Math. 76, 314–320 (2001). https://doi.org/10.1007/s000130050574
Issue Date:
DOI: https://doi.org/10.1007/s000130050574