Some theorems in the metric theory of diophantine approximation (Q3737520)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3970861
Language Label Description Also known as
default for all languages
No label defined
    English
    Some theorems in the metric theory of diophantine approximation
    scientific article; zbMATH DE number 3970861

      Statements

      Some theorems in the metric theory of diophantine approximation (English)
      0 references
      0 references
      1986
      0 references
      metric diophantine approximation
      0 references
      diophantine inequality
      0 references
      Let \(\|.\|\) denote the distance to the nearest integer, let \(\{\beta_ r\}\), \(\{a_ r\}\) be given sequences of reals and distinct integers, respectively, and let f be a function taking values in \([0,1/2]\) and with \(\sum f(r)\) divergent. Put \(\Phi (k)=2\sum^{k}_{r=1}f(r)\). It is proved that, for almost all \(\alpha\), the number of solutions of \[ \| a_ r\alpha +\beta_ r\| \leq f(r)\quad (1\leq r\leq k) \] is \(\Phi(k)+\) error term. E.g., if \(\Phi (k)\gg k^{\delta}\) for some \(\delta >0\), then the error term is \(O(\Phi(k)^{1/2+\epsilon})\). The result is very strong and interesting, because no information about \(a_ r\) is needed and no monotonicity condition is imposed upon f. There is also a generalization to n dimensions.
      0 references

      Identifiers