Metraipolis › archive › dc_f9508be61748
Improved lower bounds for the kissing number in dimensions 49 to 61 — arXiv:2611.01906
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01906
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:38:27.401Z
- SHA-256 of the archived text
b127ff0eca86eebf3e5ced908edb33c07fdb02b10f5776807a33d7a1da2fd849- Stable URL of this page
https://metraipolis.com/documento/dc_f9508be61748
How to cite
Improved lower bounds for the kissing number in dimensions 49 to 61 — arXiv:2611.01906 — arXiv (en), https://arxiv.org/abs/2611.01906 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f9508be61748 (Metraipolis archive dc_f9508be61748, sha256 b127ff0eca86eebf3e5ced908edb33c07fdb02b10f5776807a33d7a1da2fd849)
BibTeX
@misc{dcf9508be61748,
title = {Improved lower bounds for the kissing number in dimensions 49 to 61 — arXiv:2611.01906},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01906},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f9508be61748; sha256 b127ff0eca86eebf3e5ced908edb33c07fdb02b10f5776807a33d7a1da2fd849},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01906. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give explicit kissing configurations in R^d for every d = 49, ..., 61. The lower bound is improved over the best previously published value in all thirteen dimensions, by margins from 232 to 159,220 points and by 506,461 points in total. The configurations are obtained from the antipodal block lift of Yang et al. applied to the 52,416,000-point minimal shell of the extremal even unimodular lattice P_48p, using a class of 7,193 minimal lines and, in each dimension, a kissing configuration of R^k (k <= 15) with the largest available number of antipodal pairs. Two ingredients are new. The published class of 7,077 lines is grown to 7,193 by local search in three stages, as a sequence of exchanges between candidate lines and class lines; and the point count, which equals 52,416,000 + 2S + 2t with t the number of antipodal pairs and S the size of the union of t isometric images of the class, is maximised as a maximum-coverage problem by greedy search with iterated local search over pools of 4,000 automorphic images, reaching 92-100% of the trivial bound 7,193t. All results are verified in exact integer arithmetic, and the certificates are distributed with the code. Code and data: this https URL Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Metric Geometry (math.MG) ; Information Theory (cs.IT); Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.01906 — 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-11-03T11:05:22.350Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).