Abstract
Inspired by the Croot-Lev-Pach breakthrough, Jordan Ellenberg and Dion Gijswijt have recently amazed the combinatorial world by proving that the largest size of a subset of with no 3-term arithmetic progressions is exponentially less than the size, of (and, more generally, for ). Here we give a motivated, top-down, rendition of their beautiful proof, that aims to make it appreciated by a wider audience.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.