Tammes problem $T(21)$

21 points on a sphere with the largest least angle known, and arcs joining the pairs at the least angle; points on the far side are faint

The largest possible least angle, in degrees, between two of $21$ points on a sphere.

Lower bound: ${\approx}45.6132231057$ Checked construction
Upper bound: ${\approx}47.82560$ 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}47.82560$ 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
1991-05-01 $\ge {\approx}45.6132231057$ D.A. Kottwitz, The densest packing of equal circles on a sphere, Acta Crystallographica A47 (1991) 158-165.
[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 45.61322310$, tammes-21-lower-45p61322310