Almost-Sharp Quantitative Duffin-Schaeffer without GCD Graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Vazquez, Santiago
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909318959333376
author Vazquez, Santiago
author_facet Vazquez, Santiago
contents In recent work, Koukoulopoulos, Maynard and Yang proved an almost sharp quantitative bound for the Duffin-Schaeffer conjecture, using the Koukoulopoulos-Maynard technique of GCD graphs. This coincided with a simplification of the previous best known argument by Hauke, Vazquez and Walker, which avoided the use of the GCD graph machinery. In the present paper, we extend this argument to the new elements of the proof of Koukoulopoulos-Maynard-Yang. Combined with the work of Hauke-Vazquez-Walker, this provides a new proof of the almost sharp bound for the Duffin-Schaeffer conjecture, which avoids the use of GCD graphs entirely.
format Preprint
id arxiv_https___arxiv_org_abs_2409_10386
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Almost-Sharp Quantitative Duffin-Schaeffer without GCD Graphs
Vazquez, Santiago
Number Theory
In recent work, Koukoulopoulos, Maynard and Yang proved an almost sharp quantitative bound for the Duffin-Schaeffer conjecture, using the Koukoulopoulos-Maynard technique of GCD graphs. This coincided with a simplification of the previous best known argument by Hauke, Vazquez and Walker, which avoided the use of the GCD graph machinery. In the present paper, we extend this argument to the new elements of the proof of Koukoulopoulos-Maynard-Yang. Combined with the work of Hauke-Vazquez-Walker, this provides a new proof of the almost sharp bound for the Duffin-Schaeffer conjecture, which avoids the use of GCD graphs entirely.
title Almost-Sharp Quantitative Duffin-Schaeffer without GCD Graphs
topic Number Theory
url https://arxiv.org/abs/2409.10386