论文信息 - Chang's lemma via Pinsker's inequality - 字舞流文

Chang's lemma via Pinsker's inequality

Abstract Extending the idea in Impagliazzo et al. (2014) we give a short information theoretic proof for Chang’s lemma that is based on Pinsker’s inequality.

Yaqiao Li | Lianna Hambardzumyan | Yaqiao Li | Lianna Hambardzumyan

[1] Jacob Fox,et al. A new proof of the graph removal lemma , 2010, ArXiv.

[2] Mark Braverman. Interactive information and coding theory , 2014 .

[3] V. Rödl,et al. Proof of a hypercontractive estimate via entropy , 2001 .

[4] Bart Selman,et al. On the Erdős Discrepancy Problem , 2014, CP.

[5] E. Friedgut. An information-theoretic proof of a hypercontractive inequality , 2015, 1504.01506.

[6] Mark Braverman,et al. From information to exact communication , 2013, STOC '13.

[7] T. Tao. THE LOGARITHMICALLY AVERAGED CHOWLA AND ELLIOTT CONJECTURES FOR TWO-POINT CORRELATIONS , 2015, Forum of Mathematics, Pi.

[8] Li-Yang Tan,et al. Hypercontractivity Via the Entropy Method , 2013, Theory Comput..

[9] Mei-Chu Chang. A polynomial bound in Freiman's theorem , 2002 .

[10] T. Sanders,et al. Analysis of Boolean Functions , 2012, ArXiv.

[11] David J. Galvin,et al. Three tutorial lectures on entropy and counting , 2014, 1406.7872.

[12] Alexander Russell,et al. An Entropic Proof of Chang's Inequality , 2014, SIAM J. Discret. Math..

[13] J. Wolf. Some applications of relative entropy in additive combinatorics , 2017, BCC.

[14] J. Radhakrishnan. Entropy and Counting ∗ , 2001 .