Tammes problem $T(16)$
The largest possible least angle, in degrees, between two of $16$ points on a sphere.
Lower bound:
${\approx}52.2443957527$
Checked construction
Upper bound:
$53.27$
Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence.
A bound is discovered in the literature, or by a certificate submitted here.
Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction).
Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature.
Submit a certificate.
| Date |
Bound |
Discovery |
Best evidence |
| 1943 |
$\le {\approx}54.85488$
|
L. Fejes Tóth, Über die Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems, Jahresbericht der Deutschen Mathematiker-Vereinigung 53 (1943) 66-68.
[via O.R. Musin and A.S. Tarasov, Extremal problems of circle packings on a sphere and irreducible contact graphs, Proceedings of the Steklov Institute of Mathematics 288 (2015) 117-131, arXiv:1410.0744.]
|
Literature
|
| 1951 |
$\ge {\approx}52.2443957527$
|
K. Schütte and B.L. van der Waerden, Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?, Mathematische Annalen 123 (1951) 96-124.
[via H. Cohn, Table of spherical codes, https://spherical-codes.org (retrieved 2026-11-17); archived as MIT DSpace hdl:1721.1/153543 (2024).]
|
Checked construction
via $\ge 52.24439575$, tammes-16-lower-52p24439575
|
| 2003 |
$\le 53.92$
|
K. Böröczky and L. Szabó, Arrangements of 13 points on a sphere, in A. Bezdek (ed.), Discrete Geometry, Marcel Dekker (2003) 111-184; and Arrangements of 14, 15, 16 and 17 points on a sphere, Studia Scientiarum Mathematicarum Hungarica 40 (2003) 407-421.
[via C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, Journal of the American Mathematical Society 21 (2008) 909-924.]
|
Literature
|
| 2008 |
$\le 53.27$
|
C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, Journal of the American Mathematical Society 21 (2008) 909-924.
|
Literature
|