A Motivated Rendition of the Ellenberg-Gijswijt Gorgeous proof that the Largest Subset of F3nF_3^n with No Three-Term Arithmetic Progression is O(cn)O(c^n), with $c=\root 3 \of {(5589+891\,\sqrt {33})}/8=2.75510461302363300022127...$

preprint2016arXivOpen access

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 F3nF_3^n with no 3-term arithmetic progressions is exponentially less than the size, 3n3^n of F3nF_3^n (and, more generally, qnq^n for FqnF_q^n). Here we give a motivated, top-down, rendition of their beautiful proof, that aims to make it appreciated by a wider audience.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.