Approximate arithmetic structure in large sets of integers
From MaRDI portal
Abstract: We prove that if a set is `large' in the sense of ErdH{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap length of the progression, we improve a previous result of to for any .
Recommendations
- Almost arithmetic progressions in the primes and other large sets
- Approximate polynomial structure in additively large sets
- Integer Sum Sets Containing Long Arithmetic Progressions
- Long arithmetic progressions in sumsets: Thresholds and bounds
- On the structure of sets with many k-term arithmetic progressions
Cites work
- scientific article; zbMATH DE number 1090401 (Why is no real title available?)
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- A new proof of Szemerédi's theorem
- Almost arithmetic progressions in the primes and other large sets
- An ergodic Szemerédi theorem for commuting transformations
- Arithmetic patches, weak tangents, and dimension
- Assouad dimension and fractal geometry
- On sets of integers containing k elements in arithmetic progression
- Perturbations, deformations, and variations (and “near-misses") in geometry, physics, and number theory
- The primes contain arbitrarily long arithmetic progressions
Cited in
(4)
This page was built for publication: Approximate arithmetic structure in large sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054557)