On sequences with prescribed metric discrepancy behavior
Abstract
An important result of H. Weyl states that for every sequence (an)n≥ 1 of distinct positive integers the sequence of fractional parts of (an α )n ≥1 is uniformly distributed modulo one for almost all α. However, in general it is a very hard problem to calculate the precise order of convergence of the discrepancy DN of (\an α \)n ≥ 1 for almost all α. By a result of R. C. Baker this discrepancy always satisfies N DN = O (N12+) for almost all α and all >0. In the present note for arbitrary γ ∈ (0, 12] we construct a sequence (an)n ≥ 1 such that for almost all α we have NDN = O (Nγ) and NDN = (Nγ-) for all > 0, thereby proving that any prescribed metric discrepancy behavior within the admissible range can actually be realized.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.