Covering the Large Spectrum and Generalized Riesz Products
From MaRDI portal
Publication:5346540
DOI10.1137/15M1048604zbMath1404.94023arXiv1508.07109OpenAlexW2964210329MaRDI QIDQ5346540
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.07109
Convex programming (90C25) Applications of mathematical programming (90C90) Measures of information, entropy (94A17) Additive bases, including sumsets (11B13) Arithmetic progressions (11B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sets of large exponential sums
- On Roth's theorem on progressions
- A polynomial bound in Freiman's theorem.
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- An Entropic Proof of Chang's Inequality
- Some applications of relative entropy in additive combinatorics
This page was built for publication: Covering the Large Spectrum and Generalized Riesz Products