A uniform set with fewer than expected arithmetic progressions of length 4
From MaRDI portal
(Redirected from Publication:2220982)
Recommendations
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- scientific article
- A Note on a Question of Erdős and Graham
- On the structure of steps of three-term arithmetic progressions in a dense set of integers
- Fourier analysis and Szemerédi's theorem
- scientific article; zbMATH DE number 3886201
- Arithmetic progressions of length three in subsets of a random set
- Four‐term progression free sets with three‐term progressions in all large subsets
- Roth's theorem in \(\mathbb Z^n_4\)
- Szemerédi's theorem and problems on arithmetic progressions
Cites work
- A new proof of Szemerédi's theorem
- Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
- On Non-Averaging Sets of Integers
- On sets of integers containing k elements in arithmetic progression
- Open problems in additive combinatorics
- The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
Cited in
(8)- scientific article; zbMATH DE number 5284597 (Why is no real title available?)
- Arithmetic progressions with constant weight
- On uncommon systems of equations
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- Constructing Small Sets that are Uniform in Arithmetic Progressions
- Linear configurations containing 4-term arithmetic progressions are uncommon
- On the local Fourier uniformity problem for small sets
- Patterns without a popular difference
This page was built for publication: A uniform set with fewer than expected arithmetic progressions of length 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220982)