An improved constant in Banaszczyk's transference theorem
Abstract
R L [1]#1 We show that \[ μ() λ1(*) < ( 0.1275 + o(1) ) · n \; , \] where μ() is the covering radius of an n-dimensional lattice ⊂ n and λ1(*) is the length of the shortest non-zero vector in the dual lattice *. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.