Improved lattice-packing bounds in small dimensions
math.NT, math.CO
Submitted: 2026-10-26
Updated: 2026-10-26
Comments: links to a GitHub repository with relevant numerical data
License: http://creativecommons.org/licenses/by/4.0/
The gist: We strengthen the upper bound on the density of a lattice packing in small dimensions.
Abstract
We strengthen the upper bound on the density of a lattice packing in small dimensions. A lattice cannot have too many short vectors; we modify the Cohn--Elkies linear program accordingly by allowing the auxiliary function to be positive on a short interval beyond the minimum distance. For 11 at most n at most 16, our bound is tighter than the three-point bound of Cohn, de Laat and Salmon. For n in [17, 23] [25, 40] [43, 57] [62, 75] [83, 91], our bound lies below the published numerical values of the Cohn--Elkies bound.
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b