Abstract
We prove that if a set is `large' in the sense of Erdő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 o(Δ) to O(Δα) for any α∈(0,1).
| Original language | English |
|---|---|
| Pages (from-to) | 163-174 |
| Journal | Real Analysis Exchange |
| Volume | 46 |
| Issue number | 1 |
| Early online date | 14 Oct 2021 |
| DOIs | |
| Publication status | Published - 2021 |
Fingerprint
Dive into the research topics of 'Approximate arithmetic structure in large sets of integers'. Together they form a unique fingerprint.Projects
- 2 Finished
-
New perspectives in the dimension: New perspectives in the dimension theory of fractals
Fraser, J. (PI)
1/09/19 → 31/01/23
Project: Standard
-
Fourier analytic techniques: Fourier analytic techniques in geometry and analysis
Fraser, J. (PI) & Falconer, K. (CoI)
1/02/18 → 11/06/21
Project: Standard
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver