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 Delta of the progression, we improve a previous result of o(Delta) to O(Deltaalpha) for any alphain(0,1).











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)