NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
From MaRDI portal
Publication:4604480
DOI10.1112/S0025579317000316zbMath1434.11037arXiv1705.01703OpenAlexW2963683228MaRDI QIDQ4604480
Publication date: 26 February 2018
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.01703
Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
Additive combinatorics and graph theory, A Szemerédi-type theorem for subsets of the unit cube, Reciprocal Sums and Counting Functions, Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions, Sets without k‐term progressions can have many shorter progressions, Unnamed Item, Unnamed Item, Arithmetic Progressions in the Graphs of Slightly Curved Sequences, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Szemerédi's Theorem in the Primes, Bounds for sets with no polynomial progressions, Fermat’s Last Theorem Implies Euclid’s Infinitude of Primes, Arithmetic progressions, different regularity lemmas and removal lemmas, Further bounds in the polynomial Szemer
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On certain other sets of integers
- On Roth's theorem on progressions
- Roth's theorem on progressions revisited
- John-type theorems for generalized arithmetic progressions and iterated sumsets
- Quadratic uniformity of the Möbius function
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Self-testing/correcting with applications to numerical problems
- A statistical theorem of set addition
- An improved construction of progression-free sets
- Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
- On triples in arithmetic progression
- Irregularities of sequences relative to arithmetic progressions. IV
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Integer sets containing no arithmetic progressions
- A Note on Elkin’s Improvement of Behrend’s Construction
- An arithmetic regularity lemma, associated counting lemma, and applications
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
- Integer Sets Containing No Arithmetic Progressions
- AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
- On sets of integers containing no four elements in arithmetic progression
- A non-conventional ergodic theorem for a nilsystem
- On Some Sequences of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- A new proof of Szemerédi's theorem
