Metraipolis › archive › dc_e2a357229dab

Large-Scale Autonomous Discovery of Kissing Number Constructions — arXiv:2609.35051

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.35051
License (as archived)
CC0-1.0
Archived
2026-10-07T23:47:00.060Z
SHA-256 of the archived text
ec9272e27fa0b00e110ea09a774d53bbd02edee9c9d1642c362ad5e7a65062d1
Stable URL of this page
https://metraipolis.com/documento/dc_e2a357229dab

How to cite

Large-Scale Autonomous Discovery of Kissing Number Constructions — arXiv:2609.35051 — arXiv (en), https://arxiv.org/abs/2609.35051 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2a357229dab (Metraipolis archive dc_e2a357229dab, sha256 ec9272e27fa0b00e110ea09a774d53bbd02edee9c9d1642c362ad5e7a65062d1)
BibTeX
@misc{dce2a357229dab,
  title = {Large-Scale Autonomous Discovery of Kissing Number Constructions — arXiv:2609.35051},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.35051},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2a357229dab; sha256 ec9272e27fa0b00e110ea09a774d53bbd02edee9c9d1642c362ad5e7a65062d1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35051. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The kissing-number problem is a classical problem in discrete geometry whose exact solution is known in only a few dimensions. Recent artificial-intelligence approaches have begun to discover improved configurations through large-scale numerical and combinatorial search, but converting such searches into general mathematical constructions and rigorous proofs remains challenging. Here we use Qiushi Engine, an autonomous multi-agent research system, to investigate kissing numbers and obtain new lower bounds in nineteen dimensions: $25$, $27$, $32$--$39$, $43$, $45$, and $49$--$55$. The resulting constructions arise from distinct structural mechanisms, including coordinated motions of contact layers, labelled direction reuse, joint support exchanges, signed-code replacements, cross-shell lattice constructions, low-overlap lattice isometries, and spherical-design moment certificates. They yield sharp capacities for parameterized signed-code models, deterministic image-union guarantees, and exact section and projection counts controlled by embedded root systems and anchor-graph statistics. These methods yield, among others, $K(25)\ge197580$, $K(27)\ge201567$, $K(38)\ge591900$, $K(43)\ge2553792$, $K(45)\ge7380090$, and $K(55)\ge53301140$. The autonomous system carried out the construction searches, mathematical analysis and computational verification, while each final result was reduced to explicit mathematical arguments and independently checkable finite certificates. Our results illustrate how autonomous research systems can move beyond optimization within fixed formulations to discover new mathematical representations and constructions at scale.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.35051 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:26:01.135Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).