Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-08T06:13:03.154Z Has data issue: false hasContentIssue false

NEW BOUNDS FOR SZEMERÉDI’S THEOREM, III: A POLYLOGARITHMIC BOUND FOR $r_{4}(N)$

Published online by Cambridge University Press:  29 November 2017

Ben Green
Affiliation:
Mathematical Institute, Andrew Wiles Building, Radcliffe Observatory Quarter, Woodstock Rd, Oxford OX2 6GG, U.K. email ben.green@maths.ox.ac.uk
Terence Tao
Affiliation:
Department of Mathematics, UCLA, Los Angeles CA 90095-1555, U.S.A. email tao@math.ucla.edu

Abstract

Define $r_{4}(N)$ to be the largest cardinality of a set $A\subset \{1,\ldots ,N\}$ that does not contain four elements in arithmetic progression. In 1998, Gowers proved that

$$\begin{eqnarray}r_{4}(N)\ll N(\log \log N)^{-c}\end{eqnarray}$$
for some absolute constant $c>0$ . In 2005, the authors improved this to
$$\begin{eqnarray}r_{4}(N)\ll N\text{e}^{-c\sqrt{\log \log N}}.\end{eqnarray}$$
In this paper we further improve this to
$$\begin{eqnarray}r_{4}(N)\ll N(\log N)^{-c},\end{eqnarray}$$
which appears to be the limit of our methods.

Information

Type
Research Article
Copyright
Copyright © University College London 2017