The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation
Lorenz Fr\"uhwirth, Manuel Hauke

TL;DR
This paper proves a multiplicative Duffin-Schaeffer type theorem for Diophantine approximation in multiple dimensions, removing the monotonicity condition and settling a conjecture in the field.
Contribution
It establishes a new criterion for multiplicative Diophantine approximation without monotonicity, extending previous results and confirming a conjecture by Beresnevich, Haynes, and Velani.
Findings
Established a Duffin-Schaeffer-type criterion for multiplicative approximation in multiple dimensions.
Removed the monotonicity assumption in the approximation function.
Confirmed a conjecture by Beresnevich, Haynes, and Velani.
Abstract
Given a monotonically decreasing , Khintchine's Theorem provides an efficient tool to decide whether, for almost every , there are infinitely many such that . The recent result of Koukoulopoulos and Maynard provides an elegant way of removing monotonicity when only counting reduced fractions. Gallagher showed a multiplicative higher-dimensional generalization to Khintchine's Theorem, again assuming monotonicity. In this article, we prove the following Duffin-Schaeffer-type result for multiplicative approximations: For any , any function (not necessarily monotonic) and almost every , there exist infinitely many such that $\prod\limits_{i=1}^k \left\lvert \alpha_i -…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · History and Theory of Mathematics · Algebraic Geometry and Number Theory
