A Reverse Minkowski Theorem
Abstract
R L We prove a conjecture due to Dadush, showing that if ⊂ n is a lattice such that (') 1 for all sublattices ' ⊂eq , then \[ Σ y ∈ e-π t2 \| y\|2 3/2 \; , \] where t := 10( n + 2). From this we derive bounds on the number of short lattice vectors, which can be viewed as a partial converse to Minkowski's celebrated first theorem. We also derive a bound on the covering radius.
0
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.