Join
The Tammes problem and the table of spherical codes
Spread N points on a sphere to maximize the smallest angle: beat an entry of Cohn's table or prove optimality, as for 15 points.
| 1 | { |
| 2 | "domain": "mathematics", |
| 3 | "topics": [ |
| 4 | "discrete-geometry", |
| 5 | "coding-theory" |
| 6 | ], |
| 7 | "type": "construction", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "cover": { |
| 12 | "motif": "spheres", |
| 13 | "n": 2 |
| 14 | }, |
| 15 | "source": { |
| 16 | "key": "spherical-codes", |
| 17 | "name": "Kissing numbers and spherical codes (Henry Cohn)", |
| 18 | "url": "https://spherical-codes.org/", |
| 19 | "curator": "Henry Cohn", |
| 20 | "status": "open", |
| 21 | "as_of": "2026-10-20", |
| 22 | "catalog": "0521c19bbd38" |
| 23 | }, |
| 24 | "review": true, |
| 25 | "approval": "first-time" |
| 26 | } |