Tag Archives: Cap set problem

Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.

While slowly writing Post 5 (now planned to be Post 6) of our polymath10 project on the Erdos-Rado sunflower conjecture, the very recent proof (see this post) that cap sets have  exponentially small density has changed matters greatly! It implies … Continue reading

Posted in Combinatorics, Polymath10 | Tagged , , , | 36 Comments

Analysis of Boolean Functions – Week 7

Lecture 11 The Cap Set problem We presented Meshulam’s  bound for the maximum number of elements in a subset A of not containing a triple x,y,x of distinct elements whose sum is 0. The theorem is analogous to Roth’s theorem … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Teaching | Tagged , , | Leave a comment

Tentative Plans and Belated Updates II

  Elementary school reunion: Usually, I don’t write about personal matters over the blog, but having (a few weeks ago) an elementary school reunion after 42 years was a moving and exciting event as to consider making an exception. For now, … Continue reading

Posted in Updates | Tagged , , , | 6 Comments