Holding 33 points: explicit local stability of the known 40-point kissing configurations in dimension five

A kissing configuration in R^5 is a set of unit vectors with pairwise inner products at most 1/2. Four non-isometric 40-point kissing configurations are known: D5, L5, Q5 and R5. We prove, with exact computer-checked certificates, the following local statement for C = L5, Q5 and R5: if a kissing configuration has 33 points within Euclidean distance 1/35 of 33 distinct points of C, after one common orthogonal map, then it has at most 40 points. The other points of the configuration are not restricted. For D5 the same statement was known at radius 1/25. The proof covers every choice of the 7 free template points: 82,010 orbits for Q5, 51,514 for L5 and 403,261 for R5, each closed by an exact polytope certificate, a cap-graph certificate, or a decomposition lemma. All certificates were replayed by a second program written separately. The supplement contains all certificate records, the programs, the written verdicts of the second check and a trace file for every number in the note. These are local statements. They do not change the known bounds on the kissing number in dimension five (the best published upper bound is 44; a 2026 preprint of Tomar gives 43), and nothing here shows that a 41-point configuration would have to be near one of the known codes. The research, computations and writing were carried out with the AI system Claude (Anthropic) under the author's direction. Not yet reviewed by a human expert. Corrections welcome: [email protected].

Authors

Publication Details

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

Holding 33 points: explicit local stability of the known 40-point kissing configurations in dimension five

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

Holding 33 points: explicit local stability of the known 40-point kissing configurations in dimension five

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

Abstract

A kissing configuration in R^5 is a set of unit vectors with pairwise inner products at most 1/2. Four non-isometric 40-point kissing configurations are known: D5, L5, Q5 and R5. We prove, with exact computer-checked certificates, the following local statement for C = L5, Q5 and R5: if a kissing configuration has 33 points within Euclidean distance 1/35 of 33 distinct points of C, after one common orthogonal map, then it has at most 40 points. The other points of the configuration are not restricted. For D5 the same statement was known at radius 1/25. The proof covers every choice of the 7 free template points: 82,010 orbits for Q5, 51,514 for L5 and 403,261 for R5, each closed by an exact polytope certificate, a cap-graph certificate, or a decomposition lemma. All certificates were replayed by a second program written separately. The supplement contains all certificate records, the programs, the written verdicts of the second check and a trace file for every number in the note. These are local statements. They do not change the known bounds on the kissing number in dimension five (the best published upper bound is 44; a 2026 preprint of Tomar gives 43), and nothing here shows that a 41-point configuration would have to be near one of the known codes. The research, computations and writing were carried out with the AI system Claude (Anthropic) under the author's direction. Not yet reviewed by a human expert. Corrections welcome: [email protected].

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
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