Lattices with exponentially large kissing numbers
Number Theory
2024-10-02 v4 Algebraic Geometry
Combinatorics
Metric Geometry
Abstract
We construct a sequence of lattices for , with exponentially large kissing numbers, namely, . We also show that the maximum lattice kissing number in dimensions verifies .
Cite
@article{arxiv.1802.00886,
title = {Lattices with exponentially large kissing numbers},
author = {Serge Vlăduţ},
journal= {arXiv preprint arXiv:1802.00886},
year = {2024}
}
Comments
Unfortunately, the main result of the paper should be considered as not proven. Namely, the constructions D and E applied to the codes with many light vectors give some lattices, but there is no proof that their kissing numbers will be exponential. The initial impression that those lattices retain all 0-1 short vectors from the least code $C_0$ in the tower, is definitely false