Opening Analysis of Boolean Functions: Additive Combinatorics
Analysis of Boolean Functions: Additive Combinatorics
- Length
- 1 h 22 min
- Level
- Graduate
- Recorded
- Carnegie Mellon University2017
Chapter 1 of 10: Introduction to additive combinatorics
Proves that any set of density alpha has a triple sumset containing a large affine subspace.
Additive combinatorics in session 21 of Carnegie Mellon University's graduate course CMU 15-859 relates small sumsets to affine subspaces. O'Donnell links linearity testing to the polynomial Freiman-Ruzsa conjecture and proves a codimension bound for triple sumsets.
Additive combinatorics in session 21 of Carnegie Mellon University's graduate course CMU 15-859 relates small sumsets to affine subspaces. O'Donnell links linearity testing to the polynomial Freiman-Ruzsa conjecture and proves a codimension bound for triple sumsets.

This lecture
Lecture 21 of 23 of Analysis of Boolean Functions.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in