Bounds for sets with no polynomial progressions
From MaRDI portal
Publication:5148388
DOI10.1017/fmp.2020.11OpenAlexW3120198763MaRDI QIDQ5148388
Publication date: 4 February 2021
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00309
Related Items
Seminorm control for ergodic averages with commuting transformations along pairwise dependent polynomials ⋮ Joint ergodicity of sequences ⋮ True complexity of polynomial progressions in finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- The primes contain arbitrarily long polynomial progressions
- Linear equations in primes
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Difference sets without \(\kappa\)-th powers
- Three-term polynomial progressions in subsets of finite fields
- Nonlinear Roth type theorems in finite fields
- A polynomial Sárközy-Furstenberg theorem with upper bounds
- On the polynomial Szemerédi theorem in finite fields
- Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Intersective sets given by a polynomial
- On sets of integers containing k elements in arithmetic progression
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
- A maximal extension of the best-known bounds for the Furstenberg–Sárközy theorem
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- POLYNOMIAL PATTERNS IN THE PRIMES
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- A new proof of Szemerédi's theorem
- Arithmetic Progressions in Sparse Sets
