On the metric theory of approximations by reduced fractions: a quantitative Koukoulopoulos-Maynard theorem

Abstract

Let : N [0,1/2] be given. The Duffin-Schaeffer conjecture, recently resolved by Koukoulopoulos and Maynard, asserts that for almost all reals α there are infinitely many coprime solutions (p,q) to the inequality |α - p/q| < (q)/q, provided that the series Σq=1∞ (q) (q) / q is divergent. In the present paper, we establish a quantitative version of this result, by showing that for almost all α the number of coprime solutions (p,q), subject to q ≤ Q, is of asymptotic order Σq=1Q 2 (q) (q) / q. The proof relies on the method of GCD graphs as invented by Koukoulopoulos and Maynard, together with a refined overlap estimate coming from sieve theory, and number-theoretic input on the "anatomy of integers". The key phenomenon is that the system of approximation sets exhibits "asymptotic independence on average" as the total mass of the set system increases.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…