Title: Inhomogeneous Khintchine-Groshev theorem without monotonicity
Abstract: Diophantine approximation is the study of approximating a real number by rational numbers. For instance, given a monotonic function $\psi:\mathbb{N}→[0,1]$, one can ask whether a real number $x$ is $\psi$-approximable. While it is generally difficult to determine whether a specific number satisfies this condition, Khintchine established a dichotomy that almost every number is $\psi$-approximable, or almost none are. Groshev extended this result to the Diophantine approximation of $n \times m$ matrices, while Szusz and Schmidt further generalized it to inhomogeneous settings. After a long history of developments, Allen and Ramírez removed the monotonicity condition on $\psi$ in the case $nm\geq 3$ and conjectured that the result also holds for $nm=2$. In this work, we prove this conjecture for the $(n,m)=(2,1)$ case and obtain a partial result for the $(n,m)=(1,2)$ case. Our approach relies on analyzing the (quasi-)independence of certain measurable sets, with a gcd condition playing a key role in overcoming technical difficulties. (
Excellent Poster Award )