Chang's lemma via Pinsker's inequality
From MaRDI portal
Publication:2279257
DOI10.1016/j.disc.2019.04.015zbMath1434.94040arXiv2005.10830OpenAlexW2943199296WikidataQ125038056 ScholiaQ125038056MaRDI QIDQ2279257
Yaqiao Li, Lianna Hambardzumyan
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.10830
Measures of information, entropy (94A17) Fourier series and coefficients in several variables (42B05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Cites Work
- A new proof of the graph removal lemma
- A polynomial bound in Freiman's theorem.
- The Erdős discrepancy problem
- THE LOGARITHMICALLY AVERAGED CHOWLA AND ELLIOTT CONJECTURES FOR TWO-POINT CORRELATIONS
- An Entropic Proof of Chang's Inequality
- Analysis of Boolean Functions
- Some applications of relative entropy in additive combinatorics
- From information to exact communication
- Proof of a hypercontractive estimate via entropy
- Unnamed Item
- Unnamed Item
This page was built for publication: Chang's lemma via Pinsker's inequality