Related papers: The Duffin-Schaeffer theorem in number fields

In this note, we review the history of Khintchine's Theorem which is the foundation of metric Diophantine approximation, and discuss several generalizations and recent breakthroughs in this area. We focus particularly on the direction of…

In Diophantine approximation, Vaaler's theorem was an important partial result towards the Duffin--Schaeffer conjecture, which was open for almost eighty years before it was recently proven by Koukoulopoulos and Maynard. A version of this…

Duffin and Schaeffer have generalized the classical theorem of Khintchine in metric Diophantine approximation in the case of any error function under the assumption that all the rational approximants are irreducible. This result is extended…

Metric Diophantine approximation in its classical form is the study of how well almost all real numbers can be approximated by rationals. There is a long history of results which give partial answers to this problem, but there are still…

Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…

Duffin and Schaeffer provided a famous counterexample to show that Khintchine's theorem fails without monotonicity assumption. Given any monotonically decreasing approximation function with divergent series, we construct…

The Duffin--Schaeffer Conjecture answers a question on how well one can approximate irrationals by rational numbers in reduced form (an imposed condition) where the accuracy of the approximation depends on the rational number. It can be…

We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating…

In this paper we consider the probabilistic theory of Diophantine approximation in projective space over a completion of Q. Using the projective metric studied by Bombieri, van der Poorten, and Vaaler we prove the analogue of Khintchine's…

The inhomogeneous Khintchine-Groshev Theorem is a classical generalization of Khintchine's Theorem in Diophantine approximation, by approximating points in $\mathbb{R}^m$ by systems of linear forms in $n$ variables. Analogous to the…

We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khinchin and Jarnik theorems. In full generality our results establish…

In these notes, we begin by recalling aspects of the classical theory of metric Diophantine approximation; such as theorems of Khintchine, Jarn\'{\i}k, Duffin-Schaeffer and Gallagher. We then describe recent strengthening of various…

We study metric Diophantine approximation in local fields of positive characteristic. Specifically, we study the problem of improving Dirichlet's theorem in Diophantine approximation and prove very general results in this context.

The idea of using measure theoretic concepts to investigate the size of number theoretic sets, originating with E. Borel, has been used for nearly a century. It has led to the development of the theory of metrical Diophantine approximation,…

Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…

Under the assumption that the approximating function $\psi$ is monotonic, the classical Khintchine-Groshev theorem provides an elegant probabilistic criterion for the Lebesgue measure of the set of $\psi$-approximable matrices in $\R^{mn}$.…

In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…

We prove versions of Khintchine's Theorem (1924) for approximations by rational numbers whose numerators lie in randomly chosen sets of integers, and we explore the extent to which the monotonicity assumption can be removed. Roughly…

We extend the Duffin--Schaeffer conjecture to the setting of systems of $m$ linear forms in $n$ variables. That is, we establish a criterion to determine whether, for a given rate of approximation, almost all or almost no $n$-by-$m$ systems…

We prove an analogue the Khinchin theorem for the Diophantine approximation by integer vectors lying on a quadratic variety. The proof is based on the study of a dynamical system on a homogeneous space of the orthogonal group. We show that…