Covering the large spectrum and generalized Riesz products

DOI10.1137/15M1048604MaRDI QIDQ5346540zbMATH OpenOpenAlexFDO

Authors James R. Lee

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

zbMATH Keywords

arithmetic progressionsentropy maximizationadditive number theorydiscrete Fourier analysis

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Measures of information, entropy (94A17) Arithmetic progressions (11B25) Additive bases, including sumsets (11B13)

Abstract: Chang's Lemma is a widely employed result in additive combinatorics. It gives bounds on the dimension of the large spectrum of probability distributions on finite abelian groups. Recently, Bloom (2016) presented a powerful variant of Chang's Lemma that yields the strongest known quantitative version of Roth's theorem on 3-term arithmetic progressions in dense subsets of the integers. In this note, we show how such theorems can be derived from the approximation of probability measures via entropy maximization.

Recommendations

• An entropic proof of Chang's inequality
• Chang's lemma via Pinsker's inequality
• On the structure of the spectrum of small sets
• A statistical approach to covering lemmas
• Sumset and Inverse Sumset Theory for Shannon Entropy

Cites work

• scientific article; zbMATH DE number 5652361 (Why is no real title available?)
• scientific article; zbMATH DE number 2159066 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A polynomial bound in Freiman's theorem.
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• An entropic proof of Chang's inequality
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• Lower bounds on the size of semidefinite programming relaxations
• On Roth's theorem on progressions
• On sets of large exponential sums
• Some applications of relative entropy in additive combinatorics

Cited in

(4)

• Proof of a conjecture of Kleinberg-Sawin-Speyer
• Chang's lemma via Pinsker's inequality
• An Explicit Croot-Łaba-Sisask Lemma Free of Probabilistic Language
• An entropic proof of Chang's inequality

This page was built for publication: Covering the large spectrum and generalized Riesz products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346540)