OpenFrontiers
← Back to the index
OP-12113Status unassessedGeometry and topology

Kissing numbers (AlphaEvolve problem 8)

Kissing numbers (AlphaEvolve problem 8). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository at commit 8f44745 (2026-07-11); the repository records AlphaEvolve results, not current research statusSource & evidence ↓

Problem statement

For a dimension n≥1n \geq 1, define the kissing number C(n)C(n) to be the maximum number of non-overlapping unit spheres that can be arranged to simultaneously touch a central unit sphere in nn-dimensional space. Establish upper and lower bounds on C(n)C(n) that are as strong as possible.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Repository result category: world record — AlphaEvolve improved on the best known result recorded at the time. See Section 6.4 in "Mathematical Exploration and Discovery at Scale" paper: arXiv:2511.02864.

Progress & source assessment

Henry Cohn maintains a list of record upper and lower bounds for kissing numbers.

Some new kissing number constructions in medium dimensions were recently constructed (with AI assistance) in this recent paper.

References
  1. [1]Georgiev, Bogdan; Gómez-Serrano, Javier; Tao, Terence; Wagner, Adam Zsolt. Repository of problems accompanying “Mathematical exploration and discovery at scale” (arXiv:2511.02864), github.com/google-deepmind/alphaevolve_repository_of_problems (commit 8f44745, 11 July 2026). — Kissing numbers (AlphaEvolve problem 8) linkApache-2.0 (repository license); problem pages reproduced with attribution.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.