arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv 0811.0809math.NT
收藏

Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem

Victor Beresnevich, Sanju Velani

英文摘要:

Under the assumption that the approximating function $ψ$ is monotonic, the classical Khintchine-Groshev theorem provides an elegant probabilistic criterion for the Lebesgue measure of the set of $ψ$-approximable matrices in $\R^{mn}$. The famous Duffin-Schaeffer counterexample shows that the monotonicity assumption on $ψ$ is absolutely necessary when $m=n=1$. On the other hand, it is known that monotonicity is not necessary when $n > 2$ (Sprindzuk) or when $n=1$ and $m>1$ (Gallagher). Surprisingly, when $n=2$ the situation is unresolved. We deal with this remaining case and thereby remove all unnecessary conditions from the classical Khintchine-Groshev theorem. This settles a multi-dimensional analogue of Catlin's Conjecture.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑