Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem

Details Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem

2008-11-05

arxiv.org/abs/0811.0809v3

Int. Math. Res. Not. 2010, No. 1, 69-86 (2010)

Mathematics

Number Theory

17 pages

Scientific paper

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}$. The famous Duffin-Schaeffer counterexample shows that the monotonicity assumption on $\psi$ 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.

Affiliated with

Also associated with

No associations

Rating

Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical metric Diophantine approximation revisited: the Khintchine-Groshev theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-629954