The kissing number in dimension sixteen is at most 7319

We prove that the kissing number in dimension sixteen is at most 7319. The best upper bound we found is 7320, from the degree-20 three-point semidefinite programming computation of Leijenhorst and de Laat (Math. Program. Comput. 2024, about 7320.107). Our proof is an exact rational certificate for the three-point bound of Bachoc and Vallentin, in the form of Machado and de Oliveira Filho, at degree 21, with value 7319.458496..., so the margin below 7320 is about 0.54. The certificate is checked in full by a program with exact rational tensor Bernstein coefficients on every box; a separately written program in ball arithmetic checks the two solutions that are mixed to form it. The supplement contains the certificate, both verifiers with their logs, and a stand-alone check script that uses only the Python standard library. AI use: this note comes from an AI-assisted research lab directed by the author; the computations, the certificate, both verifiers and the text were produced with Claude (Anthropic) under the author's direction. The second verifier was written by a separate session of the same AI system, so this is not independent human review. Not yet peer reviewed. Contact: [email protected].

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24215730
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 sixteen is at most 7319

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

The kissing number in dimension sixteen is at most 7319

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

Abstract

We prove that the kissing number in dimension sixteen is at most 7319. The best upper bound we found is 7320, from the degree-20 three-point semidefinite programming computation of Leijenhorst and de Laat (Math. Program. Comput. 2024, about 7320.107). Our proof is an exact rational certificate for the three-point bound of Bachoc and Vallentin, in the form of Machado and de Oliveira Filho, at degree 21, with value 7319.458496..., so the margin below 7320 is about 0.54. The certificate is checked in full by a program with exact rational tensor Bernstein coefficients on every box; a separately written program in ball arithmetic checks the two solutions that are mixed to form it. The supplement contains the certificate, both verifiers with their logs, and a stand-alone check script that uses only the Python standard library. AI use: this note comes from an AI-assisted research lab directed by the author; the computations, the certificate, both verifiers and the text were produced with Claude (Anthropic) under the author's direction. The second verifier was written by a separate session of the same AI system, so this is not independent human review. Not yet 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