The kissing number in dimension ten is at most 552 (full version)

Full version (12 pages) of the announcement doi:10.5281/zenodo.24187437. We prove that the kissing number in dimension ten is at most 552; the previous best upper bound was 553 (Machado and de Oliveira Filho, Exp. Math. 2018). The proof is an exact rational dual solution of the three-point semidefinite programming bound of Bachoc and Vallentin at degree 21, with value 552.99004. The theorem and the certificate are the same as in the announcement; no new bound is claimed, and no bound is claimed in any other dimension. New in this version: a self-contained proof of the dual bound with an error term in the pair constraint; the mixing lemma that repairs a floating-point solution violating the three-point constraint by at most 8e-8, with a formula for its cost; a description of the cutting-plane solver; a full description of three verification programs; and a statement of limits. The supplement contains the certificate, the three verifiers with logs, and the LaTeX source. Verifier 3, whose closing tests are all in exact rational arithmetic, is put forward as the proof of the three-point condition; Verifiers 1 and 2 are corroboration. AI use: this work comes from an AI-assisted research project directed by the author. The computations, the solver, the certificate, the three verification programs and the text were produced with Claude (Anthropic) under the author's direction; the author did not carry out the derivations, the programming or the computations by hand. All three verifiers were written with the same AI system, so this is not independent human review. Not peer reviewed. Contact: [email protected].

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24201695
Primary Topic
Advanced Optimization Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The kissing number in dimension ten is at most 552 (full version)

Учрал Ням-Осор
4 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Optimization Algorithms Research
preprint

The kissing number in dimension ten is at most 552 (full version)

Учрал Ням-Осор
preprint en

Abstract

Full version (12 pages) of the announcement doi:10.5281/zenodo.24187437. We prove that the kissing number in dimension ten is at most 552; the previous best upper bound was 553 (Machado and de Oliveira Filho, Exp. Math. 2018). The proof is an exact rational dual solution of the three-point semidefinite programming bound of Bachoc and Vallentin at degree 21, with value 552.99004. The theorem and the certificate are the same as in the announcement; no new bound is claimed, and no bound is claimed in any other dimension. New in this version: a self-contained proof of the dual bound with an error term in the pair constraint; the mixing lemma that repairs a floating-point solution violating the three-point constraint by at most 8e-8, with a formula for its cost; a description of the cutting-plane solver; a full description of three verification programs; and a statement of limits. The supplement contains the certificate, the three verifiers with logs, and the LaTeX source. Verifier 3, whose closing tests are all in exact rational arithmetic, is put forward as the proof of the three-point condition; Verifiers 1 and 2 are corroboration. AI use: this work comes from an AI-assisted research project directed by the author. The computations, the solver, the certificate, the three verification programs and the text were produced with Claude (Anthropic) under the author's direction; the author did not carry out the derivations, the programming or the computations by hand. All three verifiers were written with the same AI system, so this is not independent human review. Not peer reviewed. Contact: [email protected].

Zenodo (CERN European Organization for Nuclear Research)
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon