Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 3 min ago
PreprintCC BY-SA 4.0arXiv

A lattice family with kissing numbers τ(ℒn) ≥ e2 √n

Abstract

For all prime powers q≥5, we construct lattices ℒq⊆ℤq with kissing numbers τ(ℒq)≥ (1/2πe2+o(1))√q e2√q. The same asymptotic bound holds on a set of integer dimensions of natural density $1$, and in every sufficiently large integer dimension n with an additional factor e−1/2n1/40. The construction is an extension of a previous construction by Bennett-Peikert based on Reed-Solomon codes.

Related

  1. New lower bounds for kissing numbers in dimensions 32-35 and 37-39
    Qihong Lin
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. New upper bounds for average kissing numbers
    Mark Bockhaus, Alexey Glazyrin
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  3. New lower bounds for kissing numbers in dimensions $25−−31$
    Rustem Takhanov, Stanislav Yun
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Lattice points close to a smooth curve and squarefull numbers in short intervals. II
    Ognian Trifonov
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
  5. A unified family of counterexamples to Batyrev's non-negativity conjecture on stringy Hodge numbers
    Dimitrios I. Dais
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{laarhoven2026lattice,
  title = {{A lattice family with kissing numbers $τ(\mathcalL_n) \ge e^2 \sqrtn$}},
  author = {Thijs Laarhoven and Scott Duke Kominers},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.13608},
  eprint = {2609.13608},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13608},
  note = {CC BY-SA 4.0},
}
RIS
TY  - UNPB
TI  - A lattice family with kissing numbers τ(ℒ_n) ≥ e^2 √n
AU  - Thijs Laarhoven
AU  - Scott Duke Kominers
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.13608
UR  - https://arxiv.org/abs/2609.13608
AB  - For all prime powers q≥5, we construct lattices ℒ_q⊆ℤ^q with kissing numbers τ(ℒ_q)≥ (1/2πe^2+o(1))√q e^2√q. The same asymptotic bound holds on a set of integer dimensions of natural density $1$, and in every sufficiently large integer dimension n with an additional factor e^−1/2n^1/40. The construction is an extension of a previous construction by Bennett-Peikert based on Reed-Solomon codes.
ER  -