New bounds for Szemerédi's theorem. III: A polylogarithmic bound for r₄(n)
From MaRDI portal
Publication:4604480
Abstract: Define to be the largest cardinality of a set 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 . 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3169559 (Why is no real title available?)
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- scientific article; zbMATH DE number 3737735 (Why is no real title available?)
- scientific article; zbMATH DE number 3523693 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A new proof of Szemerédi's theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A non-conventional ergodic theorem for a nilsystem
- A note on Elkin's improvement of Behrend's construction
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- A statistical theorem of set addition
- AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
- Additive combinatorics
- An arithmetic regularity lemma, an associated counting lemma, and applications
- Integer Sets Containing No Arithmetic Progressions
- Integer sets containing no arithmetic progressions
- Irregularities of sequences relative to arithmetic progressions. IV
- John-type theorems for generalized arithmetic progressions and iterated sumsets
- Low-degree tests at large distances
- Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
- New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
- On Roth's theorem on progressions
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Some Sequences of Integers
- On certain other sets of integers
- On sets of integers containing no four elements in arithmetic progression
- On triples in arithmetic progression
- Quadratic uniformity of the Möbius function
- Roth's theorem on progressions revisited
- Self-testing/correcting with applications to numerical problems
Cited in
(18)- Improved bounds for five-term arithmetic progressions
- A Szemerédi-type theorem for subsets of the unit cube
- Further bounds in the polynomial Szemerédi theorem over finite fields
- Roth's theorem in \(\mathbb Z^n_4\)
- scientific article; zbMATH DE number 7497817 (Why is no real title available?)
- Arithmetic progressions in the graphs of slightly curved sequences
- Sets without k‐term progressions can have many shorter progressions
- Fermat's last theorem implies Euclid's infinitude of primes
- Additive combinatorics and graph theory
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Szemerédi's Theorem in the Primes
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
- Polynomial progressions in topological fields
- scientific article; zbMATH DE number 7733110 (Why is no real title available?)
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- Reciprocal sums and counting functions
- Bounds for sets with no polynomial progressions
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)
