The kissing number in dimension eleven is at most 867
We prove that the kissing number in dimension eleven is at most 867. The best upper bound we found is 868, from the degree-20 three-point semidefinite programming computation of Leijenhorst and de Laat (Math. Program. Comput. 2024). 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 867.933547..., so the margin below 868 is about 0.066. 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 triple constraint holds with a margin of about 1.9e-8, attained at a boundary point of the domain. 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.24218555
- Primary Topic
- Advanced Optimization Algorithms Research
- Type
- preprint