Skip to content
Preprint

Lattices with Large Kissing Number from Local Density

Oct 2026 · 0 citations · 35 references
Mathematics

Abstract

Let $\kappa_p(n)$ denote the maximum kissing number of a lattice $\mathcal{L} \subset \mathbb{R}^n$. We prove that $\kappa_p(n) \geq 2^{\Omega(\sqrt{n})}$ for all $p\ge 1$ and that $\kappa_p(n) \geq \Omega(\alpha_p^n)$ for all $p>2$, where $\alpha_p>1$ is a constant depending only on $p$. In particular, our former result improves on the previously best known lower bound of $\kappa_2(n) \geq 2^{\Theta(\log^2 n)}$ for the $\ell_2$ kissing number, which has stood for over $60$ years. (In concurrent and independent work, Laarhoven and Kominers [arXiv, 2026] showed a similar lower bound on $\kappa_2(n)$ using similar techniques.) In fact, our lower bounds follow from efficient (randomized) constructions of lattices with large kissing number. Our results use a general construction of lattices with large kissing number. Specifically, we show a simple equivalence between such lattices and a new object that we call an exact locally dense lattice. Closely related objects appear throughout the literature on computational lattice problems. Our constructions of lattices with large kissing number then follow as corollaries by showing that constructions due to Bennett and Peikert [RANDOM, 2023] (using Craig lattices) and Aggarwal and Stephens-Davidowitz [STOC, 2018] (using sparsification of $\mathbb{Z}^n$) in fact give exact locally dense lattices, as well as a new construction of exact locally dense lattices built from rotations of the $m$-dimensional checkerboard lattice $D_m$.

View source

Similar papers

Preprint Oct 2026

Strongly log-concave measures and lattices

Let $\Lambda \subseteq \mathbb{R}^n$ be a full rank lattice with the property that $\det \Gamma \ge 1$ for all sublattices $\Gamma \subseteq \Lambda^*$. We prove that there exists a symmetric random vector $X \in \mathbb{R}^n$ with a smooth, strictly positive density $f : \mathbb{R}^n \to (0, \infty)$ satisfying that (...

Brayden Letwin, Victor Reis, T. Rothvoss · 0 citations
Preprint Oct 2026

Random Cayley sum hypergraphs and $k$-fold sumsets

We denote by $f_k(\Gamma)$ the largest integer with the property that every subset of a finite abelian group $\Gamma$ of size at least $|\Gamma| - f_k(\Gamma)$ is a $k$-fold sumset. Extending a recent result of Alon and Pham, we prove that $$ f_k(\Gamma) \leq \widetilde{O} \left(n^{(2k-1)/(4k-3)}\right) $$ holds for al...

Jihyo Chae, Hyunwoo Lee · 1 citation
Preprint Sep 2026

On a Tur\'an's theorem for small primes

Denote by $\omega(n)$ the number of distinct prime divisors of the natural number $n$. In 2007, Granville and Soundararajan gave a quite new method to compute the higher moments $\sum_{n\leq x}(\omega(n)-\log\log x)^{k}$, for a wide range of integers $k\geq 2$. In this notes, we shall apply the method for $\omega_{z}(n...

T. Minamide, Haruka Sakai, Y. Tanigawa · 1 citation
Preprint Nov 2026

On integers $n$ relatively prime to $\lfloor \alpha n^2\rfloor$

For $\alpha\in\mathbb{R}$ and $k\in\mathbb{N}$, let $S_{\alpha,k}(x):=\#\{n\in\mathbb N:n\le x,\ \gcd(n,\lfloor\alpha n^k\rfloor)=1\}$. Roth conjectured, and Watson proved, that $S_{\alpha,1}(x)\sim 6x/\pi^2$ for every irrational $\alpha$. Whether the same asymptotic holds for every fixed $k\ge2$ is a special case of a...

A. Chatterjee · 0 citations
Preprint Oct 2026

Moments and Large Geometric Monodromy for Linearly Constrained Kloosterman Families

Let $q=p^a$ with $p$ prime, $\lambda\in\mathbb F_p^\times$, and $\psi_q=\psi\circ\mathrm{Tr}_{\mathbb F_q/\mathbb F_p}$ for a nontrivial additive character $\psi$ of $\mathbb F_p$. For $n\ge2$ we study $\Sigma_n(h)=\sum_{u\in(\mathbb F_q^\times)^n,\sum_i h_i u_i=-\lambda}\psi_q(\sum_i u_i^{-1})$. On $\mathbb G_m^n$ we...

Hamed Ebadi · 0 citations
Preprint Oct 2026

Families that intersect in an arithmetic progression

For $n\in\mathbb N$, let $\mu_n$ be the uniform measure on $2^{[n]}$. A family $\mathcal F \subseteq2^{[n]}$ is called $k$-AP-intersecting if $F_1\cap F_2$ contains a nonconstant $k$-term arithmetic progression for every $F_1, F_2\in\mathcal F$. Writing $m_k$ for the supremum of $\mu_n(\mathcal F)$ over all $n$ and all...

A. Kupavskii, F. Noskov, Georgy Sokolov et al. · 0 citations

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