A Motivated Rendition of the Ellenberg-Gijswijt Gorgeous proof that the Largest Subset of F3n with No Three-Term Arithmetic Progression is O(cn), with c=2.75510461302363300022127...

By Doron Zeilberger


.pdf   .ps   .tex  

(Exclusively published in the Personal Journal of Shalosh B. Ekhad and Doron Zeilberger and arxiv.org )

Written: July 6, 2016


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


Maple package

Sample Input and Output Files for the Maple package Fqn.txt


Personal Journal of Shalosh B. Ekhad and Doron Zeilberger

Doron Zeilberger's Home Page