English
Related papers

Related papers: Proving the Duffin-Schaeffer conjecture without GC…

200 papers

We show that the parabola is of strong Khintchine type for convergence, which is the first result of its kind for curves. Moreover, Jarnik type theorems are established in both the simultaneous and the dual settings, without monotonicity on…

Number Theory · Mathematics 2018-12-18 Jing-Jing Huang

We solve the problem of giving sharp asymptotic bounds on the Hausdorff dimensions of certain sets of badly approximable matrices, thus improving results of Broderick and Kleinbock (preprint 2013) as well as Weil (preprint 2013), and…

Number Theory · Mathematics 2017-01-13 David Simmons

In his 1960 paper, Schmidt studied a quantitative type of Khintchine-Groshev theorem for general (higher) dimensions. Recently, a new proof of the theorem was found, which made it possible to relax the dimensional constraint and more…

Number Theory · Mathematics 2023-03-22 Jiyoung Han

Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…

Number Theory · Mathematics 2025-05-01 Bo Tan , Qing-Long Zhou

We prove Haynes' version of the Duffin--Schaeffer conjecture for the $p$-adic numbers. In addition, we prove several results about an associated related but false conjecture, related to $p$-adic approximation in the spirit of Jarn\'ik and…

Number Theory · Mathematics 2022-05-11 Simon Kristensen , Mathias Løkkegaard Laursen

We study (inhomogeneous) approximation for systems of linear forms using integer points which satisfy additional primitivity constraints. The first family of primitivity constraints we consider were introduced in 2015 by Dani, Laurent, and…

Number Theory · Mathematics 2023-05-26 Demi Allen , Felipe A. Ramirez

In this paper, we explore several threads arising from our recent joint work on arithmetic holonomy bounds, which were originally devised to prove new irrationality results based on the method of Ap\'ery limits. We propose a new method to…

Number Theory · Mathematics 2025-10-07 Frank Calegari , Vesselin Dimitrov , Yunqing Tang

Given a nonnegative function $\psi : \N \to \R $, let $W(\psi)$ denote the set of real numbers $x$ such that $|nx -a| < \psi(n) $ for infinitely many reduced rationals $a/n (n>0) $. A consequence of our main result is that $W(\psi)$ is of…

Number Theory · Mathematics 2009-03-20 Alan Haynes , Andrew Pollington , Sanju Velani

In 1962, Gallagher proved an higher dimensional version of Khintchine's theorem on Diophantine approximation. Gallagher's theorem states that for any non-increasing approximation function $\psi:\mathbb{N}\to (0,1/2)$ with…

Number Theory · Mathematics 2022-03-04 Han Yu

We study the problem of improving Dirichlet's theorem of metric Diophantine approximation in the $S$-adic setting. Our approach is based on translation of the problem related to Dirichlet improvability into a dynamical one, and the main…

Number Theory · Mathematics 2024-01-30 Sourav Das , Arijit Ganguly

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

Number Theory · Mathematics 2007-05-23 Damien Roy , Michel Waldschmidt

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

Number Theory · Mathematics 2021-08-09 Christoph Aistleitner , Daniel El-Baz , Marc Munsch

This paper settles recent conjectures concerning the $p$-adic Haar measure applied to a family of sets defined in terms of Diophantine approximation. This is done by determining the spectrum of measure values for each family and seeing that…

Number Theory · Mathematics 2023-11-01 Mathias Løkkegaard Laursen

We prove a number of results on the metric and non-metric theory of Diophantine approximation for Yu's multidimensional variant of Mahler's classification of transcendental numbers. Our results arise as applications of well known results in…

Number Theory · Mathematics 2016-06-21 Simon Kristensen , Steffen Højris Pedersen , Barak Weiss

We give an elementary proof of a recent metrical Diophantine result by D. Kleinbock related to badly approximable vectors in affine subspaces.

Number Theory · Mathematics 2011-02-01 Nikolay G. Moshchevitin

This paper takes a new step in the direction of proving the Duffin-Schaeffer Conjecture for measures arbitrarily close to Lebesgue. The main result is that under a mild `extra divergence' hypothesis, the conjecture is true.

Number Theory · Mathematics 2012-01-06 Victor Beresnevich , Glyn Harman , Alan Haynes , Sanju Velani

The main goal of this note is to develop a metrical theory of Diophantine approximation within the framework of the de Mathan-Teulie Conjecture, also known as the `Mixed Littlewood Conjecture'. Let p be a prime. A consequence of our main…

Number Theory · Mathematics 2010-05-12 Yann Bugeaud , Alan Haynes , Sanju Velani

In this paper we develop a general theory of metric Diophantine approximation for systems of linear forms. A new notion of `weak non-planarity' of manifolds and more generally measures on the space of $m\times n$ matrices over $\Bbb R$ is…

Number Theory · Mathematics 2013-10-21 Victor Beresnevich , Dmitry Kleinbock , Gregory Margulis

In this paper we construct a new family of sets based on Diophantine approximation in the Euclidean space, and consider their applications in several problems in harmonic analysis. Our first application is on the Hausdorff dimension of our…

Classical Analysis and ODEs · Mathematics 2026-01-28 Longhui Li , Bochen Liu

In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…

Computational Complexity · Computer Science 2016-07-18 Christoph Berkholz , Martin Grohe