×

The k-dimensional Duffin and Schaeffer conjecture. (English) Zbl 0715.11036

The Duffin-Schaeffer conjecture in Diophantine approximation [R. J. Duffin and A. C. Schaeffer, Duke Math. J. 8, 243-255 (1941; Zbl 0025.11002)] has been a challenging open problem for almost half a century. The present paper provides a proof for a k-dimensional version (k\(\geq 2\) due to V. G. Sprindzhuk) as well as a further contribution to the case \(k=1\). The proof makes use of several results from previous attempts to master the conjecture, e.g. a generalization of Gallagher’s ergodic theorem due to V. T. Vil’chinskij (which reduces the problem to the case of measure 0 or 1).
Reviewer: F.Schweiger

MSC:

11J83 Metric theory
11K60 Diophantine approximation in probabilistic number theory
11J13 Simultaneous homogeneous approximation, linear forms

Citations:

Zbl 0025.11002
Full Text: DOI

References:

[1] DOI: 10.2969/jmsj/01340342 · Zbl 0106.04106 · doi:10.2969/jmsj/01340342
[2] DOI: 10.1016/0022-314X(70)90046-6 · Zbl 0205.34902 · doi:10.1016/0022-314X(70)90046-6
[3] DOI: 10.1215/S0012-7094-41-00818-9 · Zbl 0025.11002 · doi:10.1215/S0012-7094-41-00818-9
[4] DOI: 10.1017/S0305004100025676 · doi:10.1017/S0305004100025676
[5] Vilchinski, Dokl. Akad. Nauk BSSR 25 pp 780– (1981)
[6] Halberstam, Sieve Methods (1974)
[7] Vaaler, Pacific J. Math. 76 pp 527– (1978) · Zbl 0352.10026 · doi:10.2140/pjm.1978.76.527
[8] Sprindzuk, Metric theory of Diophantine Approximation (1979) · Zbl 0306.10037
[9] DOI: 10.2307/1971274 · Zbl 0591.10042 · doi:10.2307/1971274
[10] Khinchin, Math. Ann. 92 pp 115– (1923) · JFM 50.0125.01 · doi:10.1007/BF01448437
[11] Strauch, Acta Math. Univ. Com. 42–43 pp 87– (1983)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.