Entropy Methods in Combinatorics - Cambridge III notes

Entropy Methods in Combinatorics
Daniel Naylor

Contents
1The Khinchin (Shannon?) axioms for entropy
2A special case of Sidorenko’s conjecture
3Brégman’s Theorem
4Shearer’s lemma and applications
5The union-closed conjecture
6Entropy in additive combinatorics
7A proof of Marton’s conjecture in

𝔽_{2}^{n}