English

An improved constant in Banaszczyk's transference theorem

Metric Geometry 2019-07-23 v1 Number Theory

Abstract

\newcommand{\R}{\ensuremath{\mathbb{R}}} \newcommand{\lat}{\mathcal{L}} \newcommand{\ensuremath}[1]{#1} We show that μ(\lat)λ1(\lat)<(0.1275+o(1))n  , \mu(\lat) \lambda_1(\lat^*) < \big( 0.1275 + o(1) \big) \cdot n \; , where μ(\lat)\mu(\lat) is the covering radius of an nn-dimensional lattice \latRn\lat \subset \R^n and λ1(\lat)\lambda_1(\lat^*) is the length of the shortest non-zero vector in the dual lattice \lat\lat^*. This improves on Banaszczyk's celebrated transference theorem (Math. Annal., 1993) by about 20%. Our proof follows Banaszczyk exactly, except in one step, where we replace a Fourier-analytic bound on the discrete Gaussian mass with a slightly stronger bound based on packing. The packing-based bound that we use was already proven by Aggarwal, Dadush, Regev, and Stephens-Davidowitz (STOC, 2015) in a very different context. Our contribution is therefore simply the observation that this implies a better transference theorem.

Keywords

Cite

@article{arxiv.1907.09020,
  title  = {An improved constant in Banaszczyk's transference theorem},
  author = {Divesh Aggarwal and Noah Stephens-Davidowitz},
  journal= {arXiv preprint arXiv:1907.09020},
  year   = {2019}
}
R2 v1 2026-06-23T10:26:29.732Z