Improved bounds for five-term arithmetic progressions
From MaRDI portal
Publication:6659641
DOI10.1017/S0305004124000264MaRDI QIDQ6659641FDOQ6659641
Authors: James Leng, Ashwin Sah, Mehtaab Sawhney
Publication date: 9 January 2025
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Recommendations
Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30) Applications of the Hardy-Littlewood method (11P55)
Cites Work
- Higher order Fourier analysis
- Sur les groupes nilpotents et les anneaux de Lie
- A new proof of Szemerédi's theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- On triples in arithmetic progression
- On sets of integers containing k elements in arithmetic progression
- The quantitative behaviour of polynomial orbits on nilmanifolds
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- An inverse theorem for the Gowers \(U^4\)-norm
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- On Roth's theorem on progressions
- Title not available (Why is that?)
- Integer sets containing no arithmetic progressions
- On certain other sets of integers
- Integer Sets Containing No Arithmetic Progressions
- On Certain Sets of Integers (II)
- Roth's theorem on progressions revisited
- Polynomial sequences in groups
- Polynomial mappings of groups
- Quadratic uniformity of the Möbius function
- Nilpotent structures in ergodic theory
- On the Bogolyubov-Ruzsa lemma
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- A Polylogarithmic Bound in the Nonlinear Roth Theorem
- Title not available (Why is that?)
- Arithmetic Progressions in Sparse Sets
- Über ganzwertige ganze Funktionen.
This page was built for publication: Improved bounds for five-term arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659641)