- Print publication year: 2017
- Online publication date: July 2017

- Publisher: Cambridge University Press
- https://doi.org/10.1017/9781108332699.010
- pp 409-442

Summary

Abstract

This survey looks at some recent applications of relative entropy in additive combinatorics. Specifically, we examine to what extent entropy-increment arguments can replace or even outperform more traditional energy-increment strategies or alternative approximation arguments based on the Hahn-Banach theorem.

Introduction

Entropy has a long history as a tool in combinatorics. Starting with a well-known estimate for the sum of the first few binomial coefficients, some of the classical applications include Spencer's theorem that six standard deviations suffice, which states that given n finite sets, there exists a two-colouring of the elements such that all sets have discrepancy at most; a proof of the Loomis-Whitney inequality, which gives an upper bound on the volume of an n-dimensional body in Euclidean space in terms of its (n - 1)-dimensional projections; or Radhakrishnans proof [33] of Bregman's theorem on the maximum permanent of a 0/1 matrix with given row sums. For a beautiful introduction to these fascinating applications, as well as an extensive annotated bibliography, see [10].

There are other more recent results in additive combinatorics in particular where the concept of entropy has played a crucial role. Notable examples include Fox's improvement [7] of the bounds in the graph removal lemma (see also [30], which appeared in the proof-reading stages of this article); Szegedy's information-theoretic approach [41] to Sidorenko's conjecture (see also the blog post [14] by Gowers); Tao's solution [45] to the Erds discrepancy problem (see the discussion [44] on Tao's blog).

Since the above developments appear to be well captured by discussions online, we shall not cover them in any detail here. Instead we shall focus on a particular strand of recent results in additive combinatorics that could all be described as “approximation theorems” of a certain kind.

The text naturally splits into five parts. To start with we give a very brief introduction to the concept of entropy and its variants, in particular relative entropy (also known as Kullback-Leibler divergence). In Section 3, we state and prove a rather general sparse approximation theorem due to Lee [28].

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Surveys in Combinatorics 2017

[1] Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1193–1200. SIAM, Philadelphia, PA, 2009. , , and . The uniform hardcore lemma via approximate Bregman projections. In

[2] A quantitative improvement for Roth's theorem on arithmetic progressions. J. Lond. Math. Soc. (2), 93(3):643–663, 2016. .

[3] A polynomial bound in Freiman's theorem. Duke Math. J., 113(3):399–419, 2002. .

[4] The Green-Tao theorem: an exposition. EMS Surv. Math. Sci., 1(2):249–282, 2014. , , and .

[5] A relative Szemerédi theorem. Geom. Funct. Anal., 25(3):733–762, 2015. , , and .

[6] Elements of information theory. Wiley Series in Telecommunications. John Wiley & Sons, Inc., New York, New York, USA, 1991. and .

[7] A new proof of the graph removal lemma. Ann. of Math. (2), 174(1):561–579, 2011. .

[8] 2015. . An information-theoretic proof of a hypercontractive inequality. arXiv, 1504.01506, April

[9] Quick approximation to matrices and applications. Combinatorica, 19(2):175–220, 1999. and .

[10] 2014. . Three tutorial lectures on entropy and counting. arXiv, 1406.7872, June

[11] A new proof of Szemerédi's theorem for arithmetic progressions of length four. Geom. Funct. Anal., 8(3):529–551, 1998. .

[12] A new proof of Szemerédi's theorem. Geom. Funct. Anal., 11(3):465–588, 2001. .

[13] Decompositions, approximate structure, transference, and the Hahn-Banach theorem. Bull. Lond. Math. Soc., 42(4):573–606, 2010. .

[14] 2015. . Entropy and Sidorenko's conjecture — after Szegedy. Personal blog, https://gowers.wordpress.com/2015/11/18/entropy-and-sidorenkosconjecture-after-szegedy/, November

[15] Linear forms and quadratic uniformity for functions on Fnp. Mathematika, 57(2):215–237, 2012. and .

[16] Some constructions in the inverse spectral theory of cyclic groups. Combin. Probab. Comput., 12(2):127–138, 2003. .

[17] Fourier analysis and convexity, pages 83–96. Birkhäuser
Boston, Boston, MA, 2004. . Spectral structure of sets of integers. In

[18] Surveys in combinatorics 2005, pages 1–27. Cambridge Univ. Press, Cambridge, Cambridge, 2005. . Finite field models in additive combinatorics. In Bridget S Webb, editor,

[19] Roth's theorem in the primes. Ann. of Math. (2), 161(3):1609–1636, 2005. .

[20] Additive combinatorics, pages 69–102. Amer. Math. Soc., Providence, RI, 2007. . Montréal notes on quadratic Fourier analysis. In

[21] Boolean functions with small spectral norm. Geom. Funct. Anal., 18(1):144–162, 2008. and .

[22] An inverse theorem for the Gowers U3(G) norm. Proc. Edinb. Math. Soc. (2), 51(1):73–153, 2008. and .

[23] The primes contain arbitrarily long arithmetic progressions. Ann. of Math. (2), 167(2):481–547, 2008. and .

[24] Linear equations in primes. Ann. of Math. (2), 171(3):1753–1850, 2010. and .

[25] FOCS ‘07. 48th Annual IEEE Symposium on Foundations of Computer Science, 2007., pages 538–545. IEEE, 1995. . Hard-core distributions for somewhat hard problems. In

[26] An entropic proof of Chang's inequality. SIAM J. Discrete Math., 28(1):173–176, 2014. , , and .

[27] On information and sufficiency. Ann. Math. Stat., 22(1):79–86, 1951. and .

[28] 2015. . Covering the large spectrum and generalized Riesz products. arXiv, 1508.07109, August

[29] Complexity of hardcore set proofs. Comput. Complexity, 20(1):145–171, 2011. , , and .

[30] 2016. and . A sparse regular approximation lemma. arXiv, 1610.02676, October

[31] . Lecture 16: The hypercontractivity theorem. Personal website, https://www.cs.cmu.edu/õdonnell/booleananalysis/lecture16.pdf.

[32] 2015. . Four variants of the Fourier-analytic transference principle. arXiv, 1509.09200, September

[33] An entropy proof of Bregman's theorem. J. Combin. Theory Ser. A, 77(1):161–164, 1997. .

[34] Dense subsets of pseudorandom sets. Electronic Colloquium on Computational Complexity, 45:1–33, 2008. , , , and .

[35] 2008. , , , and . New proofs of the Green-Tao-Ziegler dense model theorem: an exposition. arXiv, 0806.0381, June

[36] A first course in probability. Macmillan Publishing Co., Inc., New York; Collier Macmillan Publishers, London, 1976. .

[37] STOC'07—Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 506–515. ACM, New York, New York, New York, USA, 2007. . Low-degree tests at large distances. In

[38] On Roth's theorem on progressions. Ann. of Math. (2), 174(1):619–636, 2011. .

[39] On the Bogolyubov–Ruzsa lemma. Anal. PDE, 5(3):627–655, 2012. .

[40] On sets of large exponential sums. Dokl. Math., 74(3):860–864, 2006. .

[41] 2014. . An information theoretic approach to Sidorenko's conjecture. arXiv, 1406.6738, June

[42] 2009. . Moser's entropy compression argument. Personal blog, https://terrytao.wordpress.com/2009/08/05/mosers-entropycompression-argument/, August

[43] Higher order Fourier analysis, volume 142 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2012. .

[44] 2015. . Entropy and rare events. Personal blog, https://terrytao.wordpress.com/2015/09/20/entropy-and-rareevents/, September

[45] The logarithmically averaged Chowla and Elliott conjectures for two-point correlations. Forum Math. Pi, 4:e8–36, 2016. .

[46] The primes contain arbitrarily long polynomial progressions. Acta Math., 201(2):213–305, 2008. and .

[47] Quadratic Goldreich-Levin theorems. SIAM J. Comput., 43(2):730–766, 2014. and .

[48] Advances in Cryptology – CRYPTO 2013, pages 93–110. Springer Berlin Heidelberg, Berlin, Heidelberg, 2013. and . A uniform min-max theorem with applications in cryptography. In

[49] Finite field models in arithmetic combinatorics – ten years on. Finite Fields Appl., 32:233–274, 2015. .

[50] On the query complexity for Showing Dense Model. Electronic Colloquium on Computational Complexity, 38, 2011. .

[51] 2013. . An arithmetic transference proof of a relative Szemerédi theorem. arXiv, 1307.4959, July

[52] 2014. . A uniform min-max theorem and characterizations of computational randomness. PhD thesis,