Bounds for sets with no polynomial progressions
From MaRDI portal
Publication:5148388
Recommendations
Cites work
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- A new proof of Szemerédi's theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A polynomial Sárközy-Furstenberg theorem with upper bounds
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Arithmetic Progressions in Sparse Sets
- Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
- Difference sets without -th powers
- Higher order Fourier analysis
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- Intersective sets given by a polynomial
- Linear equations in primes
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- Nonlinear Roth type theorems in finite fields
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- On sets of integers containing k elements in arithmetic progression
- On the polynomial Szemerédi theorem in finite fields
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Polynomial patterns in the primes
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- The primes contain arbitrarily long polynomial progressions
- Three-term polynomial progressions in subsets of finite fields
Cited in
(23)- Bounded nonwandering sets for polynomial mappings
- Sets of large dimension not containing polynomial configurations
- On the polynomial Szemerédi theorem in finite fields
- Joint ergodicity of sequences
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- Progression-free sets
- True complexity of polynomial progressions in finite fields
- Further bounds in the polynomial Szemerédi theorem over finite fields
- On several notions of complexity of polynomial progressions
- Seminorm control for ergodic averages with commuting transformations along pairwise dependent polynomials
- Multidimensional polynomial patterns over finite fields: bounds, counting estimates and Gowers norm control
- A class of singular bilinear maximal functions
- Bounds in a popular multidimensional nonlinear Roth theorem
- Polynomial progressions in topological fields
- Degree lowering for ergodic averages along arithmetic progressions
- Joint ergodicity for commuting transformations and applications to polynomial sequences
- Quantitative concatenation for polynomial box norms
- Pointwise convergence of bilinear polynomial averages over the primes
- Two-point patterns determined by curves
- Three term rational function progressions in finite fields
- On certain trilinear oscillatory integral inequalities
- Quantitative asymptotics for polynomial patterns in the primes
- On the polynomial Szemerédi theorem in finite commutative rings
This page was built for publication: Bounds for sets with no polynomial progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148388)
