Indexed metadata

Strongly log-concave measures and lattices

Brayden Letwin, Victor Reis, Thomas Rothvoss

Source record

Source: arXiv

Published: Oct 21, 2026

arXiv: 2610.29238

Open original source ↗

Source abstract

Let Λ⊂RnΛ\subset \mathbb{R}^n be a full rank lattice with the property that det⁡Γ≥1\det Γ\ge 1 for all sublattices Γ⊆Λ∗Γ\subseteq Λ^*. We prove that there exists a symmetric random vector X∈RnX \in \mathbb{R}^n with a smooth, strictly positive density f:Rn→(0,∞)f : \mathbb{R}^n \to (0, \infty) satisfying that ff is αα-strongly log-concave, where α=2π/eα= 2π/e, and X+ΛX + Λ is uniform on Rn/Λ\mathbb{R}^n/Λ. Moreover, we show that the existence of such a density ff characterizes the assumption on ΓΓ up to a constant. There are a few consequences of the above. First, for such lattices we can bound the covering radius μ(Λ,K)=max⁡x∈Rnmin⁡λ∈Λ∥x−λ∥K≤2eπ⋅EG ∥G∥K μ(Λ, K) = \max_{x \in \mathbb{R}^n} \min_{λ\in Λ} \|x-λ\|_K \le \sqrt{\frac{2e}π} \cdot \mathbb{E}_G\, \|G\|_K of a convex body K⊂RnK \subset \mathbb{R}^n containing 00 in its interior, where G∼N(0,I)G \sim N(0,I). This implies an O(nlog⁡n)O(n\sqrt{\log n}) bound for the flatness constant and an O(log⁡3/2n)O(\log^{3/2} n) bound for the subspace flatness constant. Second, we establish as a consequence an alternative proof of the reverse Minkowski theorem with an explicit constant.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.