New bounds for Szemerédi's theorem. III: A polylogarithmic bound for r₄(n)

DOI10.1112/S0025579317000316zbMATH Open1434.11037arXiv1705.01703OpenAlexW2963683228MaRDI QIDQ4604480FDOQ4604480

Authors: Terence Tao, Ben Green 

Publication date: 26 February 2018

Published in: Mathematika (Search for Journal in Brave)

Abstract: Define $r_4(N)$ to be the largest cardinality of a set $Asubset1,dots,N$ which does not contain four elements in arithmetic progression. In 1998 Gowers proved that [ r_4(N) ll N(log log N)^{-c}] for some absolute constant $c>0$. In 2005, the authors improved this to [ r_4(N) ll N e^{-csqrt{loglog N}}.] In this paper we further improve this to [ r_4(N) ll N(log N)^{-c},] which appears to be the limit of our methods.

Full work available at URL: https://arxiv.org/abs/1705.01703

Recommendations

• scientific article
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Fourier analysis and Szemerédi's theorem
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• A new proof of Szemerédi's theorem

zbMATH Keywords

Szemerédi's theorem

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Title not available (Why is that?)
• Additive combinatorics
• A new proof of Szemerédi's theorem
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Self-testing/correcting with applications to numerical problems
• On triples in arithmetic progression
• An arithmetic regularity lemma, an associated counting lemma, and applications
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
• A Szemerédi-type regularity lemma in abelian groups, with applications
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• On Roth's theorem on progressions
• Title not available (Why is that?)
• John-type theorems for generalized arithmetic progressions and iterated sumsets
• Integer sets containing no arithmetic progressions
• A note on Elkin's improvement of Behrend's construction
• On certain other sets of integers
• Low-degree tests at large distances
• Integer Sets Containing No Arithmetic Progressions
• Title not available (Why is that?)
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
• A non-conventional ergodic theorem for a nilsystem
• On Some Sequences of Integers
• Roth's theorem on progressions revisited
• A statistical theorem of set addition
• Quadratic uniformity of the Möbius function
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• On sets of integers containing no four elements in arithmetic progression
• Title not available (Why is that?)
• Title not available (Why is that?)
• Irregularities of sequences relative to arithmetic progressions. IV

Cited In (18)

• Fermat's last theorem implies Euclid's infinitude of primes
• Reciprocal sums and counting functions
• Title not available (Why is that?)
• Arithmetic progressions in the graphs of slightly curved sequences
• Sets without k‐term progressions can have many shorter progressions
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Polynomial progressions in topological fields
• Title not available (Why is that?)
• Arithmetic progressions, different regularity lemmas and removal lemmas
• Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
• Title not available (Why is that?)
• Szemerédi's Theorem in the Primes
• Bounds for sets with no polynomial progressions
• Improved bounds for five-term arithmetic progressions
• Further bounds in the polynomial Szemerédi theorem over finite fields
• A Szemerédi-type theorem for subsets of the unit cube
• Roth's theorem in \(\mathbb Z^n_4\)
• Additive combinatorics and graph theory

This page was built for publication: New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)

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