Skip to content
Preprint

A lattice family with kissing numbers $\tau(\mathcal{L}_n) \ge e^{2 \sqrt{n}}$

Sep 2026 · 0 citations · 20 references
Mathematics Computer Science

Abstract

For all prime powers $q\geq5$, we construct lattices $\mathcal{L}_q\subseteq\mathbb{Z}^q$ with kissing numbers \[ \tau(\mathcal{L}_q)\geq \left(\frac{1}{2\pi e^2}+o(1)\right)\sqrt{q}\,e^{2\sqrt{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^{-\tfrac{1}{2}n^{1/40}}$. The construction is an extension of a previous construction by Bennett-Peikert based on Reed-Solomon codes.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.