Quantitative inhomogeneous Diophantine approximation for systems of linear forms (Q7008682)

The Khinthine-Groshev theorem is a generalization of Khintchine's classical convergence-divergence criterion in metric Diophantine approximation. While in the classical setup one wants to approximate real numbers by rationals, in the setup of the Khintchine-Groshev theorem on aims to approximate points in \(\mathbb{R}^m\) by linear forms in \(n\) variables. This paper is concerned with the question whether the monotonicity assumption on the approximation function can be removed in general or not. In the case \(m=1\) and \(n=1\), that is the classical case, this question led to the famous Duffin-Schaeffer conjecture and its recent resolution by \textit{D. Koukoulopoulos} and \textit{J. Maynard} [Ann. Math. (2) 192, No. 1, 251--307 (2020; Zbl 1459.11154)]. It turns out that when \(m+n \geq 3\), the monotonicity assumption can indeed be removed [\textit{V. Beresnevich} and \textit{S. Velani}, Int. Math. Res. Not. 2010, No. 1, 69--86 (2010; Zbl 1241.11086)] in the homogeneous setup of the Khinthine-Groshev problem. In the inhomogeneous setup, this is also conjectured to be true, but only known when \(m+n \geq 4\) [\textit{D. Allen} and \textit{F. A. Ramírez}, Int. Math. Res. Not. 2023, No. 2, 1760--1794 (2023; Zbl 1516.11077)], thus leaving the cases \(m=1\) and \(n=2\), resp. \(m=2\) and \(n=1\) open. In this paper, the author makes progress on the case \(m=1\) and \(n=2\), and proves that the monotonicity assumption can be removed under a relatively weak assumption on the inhomogeneous shift parameter (namely, this parameter being not a Liouville number).