STOC 2017
A reverse Minkowski theorem
Abstract
We prove a conjecture due to Dadush, showing that if ℒ⊂ ℝ n is a lattice such that det(ℒ′) 1 for all sublattices ℒ′ ⊆ ℒ, then $$\sum_{ y ∈ℒ}^e -t 2||y||2 ≤3/2,$$ where t := 10(logn + 2). From this we also derive bounds on the number of short lattice vectors and on the covering radius.
Authors
Keywords
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 53517030095686728