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

TL;DR

This paper provides an accessible, motivated explanation of the Ellenberg-Gijswijt proof that the largest subset of F_3^n avoiding 3-term arithmetic progressions grows exponentially with a specific base c, improving understanding of this combinatorial result.

Contribution

It offers a top-down, comprehensible presentation of the Ellenberg-Gijswijt proof, making this advanced combinatorial result more accessible to a broader audience.

Findings

The maximum size of subsets of F_3^n with no 3-term arithmetic progressions is O(c^n).

The base c of the exponential bound is approximately 2.7551.

The proof is a motivated, top-down reinterpretation of the original breakthrough.

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