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 $\Delta$ of the progression, we improve a previous result of $o(\Delta)$ to $O(\Delta^\alpha)$ for any $\alpha \in (0,1)$. This improvement comes from a new approach relying on an iterative application of Szemerédi's Theorem.
Real Anal. Exchange
46(1):
163-174
(2021).
DOI: 10.14321/realanalexch.46.1.0163
ACCESS THE FULL ARTICLE
It is not available for individual sale.
This article is only available to subscribers.
It is not available for individual sale.
It is not available for individual sale.