Skip to main content
Log in

The polyhedral Tammes problem

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 19.8.1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000130050574

Keywords

Navigation