English

On sequences with prescribed metric discrepancy behavior

Number Theory 2015-07-24 v1

Abstract

An important result of H. Weyl states that for every sequence (an)n1\left(a_{n}\right)_{n\geq 1} of distinct positive integers the sequence of fractional parts of (anα)n1\left(a_{n} \alpha \right)_{n \geq1} is uniformly distributed modulo one for almost all α\alpha. However, in general it is a very hard problem to calculate the precise order of convergence of the discrepancy DND_{N} of ({anα})n1\left(\left\{a_{n} \alpha \right\}\right)_{n \geq 1} for almost all α\alpha. By a result of R. C. Baker this discrepancy always satisfies NDN=O(N12+ε)N D_{N} = \mathcal{O} \left(N^{\frac{1}{2}+\varepsilon}\right) for almost all α\alpha and all ε>0\varepsilon >0. In the present note for arbitrary γ(0,12]\gamma \in \left(0, \frac{1}{2}\right] we construct a sequence (an)n1\left(a_{n}\right)_{n \geq 1} such that for almost all α\alpha we have NDN=O(Nγ)ND_{N} = \mathcal{O} \left(N^{\gamma}\right) and NDN=Ω(Nγε)ND_{N} = \Omega \left(N^{\gamma-\varepsilon}\right) for all ε>0\varepsilon > 0, thereby proving that any prescribed metric discrepancy behavior within the admissible range can actually be realized.

Keywords

Cite

@article{arxiv.1507.06472,
  title  = {On sequences with prescribed metric discrepancy behavior},
  author = {Christoph Aistleitner and Gerhard Larcher},
  journal= {arXiv preprint arXiv:1507.06472},
  year   = {2015}
}

Comments

7 pages

R2 v1 2026-06-22T10:17:05.618Z