Polymath's combinatorial proof of the density Hales-Jewett theorem

Abstract: This is an exposition of the combinatorial proof of the density Hales--Jewett theorem, due to D.,H.,J. Polymath in 2012. The theorem says that for given

d e > 0

and

k

, for every

n > n_{0}

every set

A s u s {1, 2, d s, k}^{n}

with

| A | g e d e k^{n}

contains a combinatorial line. It implies Szemer'edi's theorem, which claims that for given

d e > 0

and

k

, for every

n > n_{0}

every set

A s u s 1, 2, d s, n

with

| A | g e d e n

contains a

k

-term arithmetic progression.

This page was built for publication: Polymath's combinatorial proof of the density Hales-Jewett theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233406)