Extremal discrepancy behavior of lacunary sequences
Abstract
In 1975 Walter Philipp proved the law of the iterated logarithm (LIL) for the discrepancy of lacunary sequences: for any sequence (nk)k ≥ 1 satisfying the Hadamard gap condition nk+1 / nk ≥ q > 1,~k ≥ 1, we have 14 2 ≤ N ∞ N DN(\ n1 x \, …, \nN x\)2 N N ≤ Cq for almost all x. In recent years there has been significant progress concerning the precise value of the limsup in this LIL for special sequences (nk)k ≥ 1 having a ``simple'' number-theoretic structure. However, since the publication of Philipp's paper there has been no progress concerning the lower bound in this LIL for generic lacunary sequences (nk)k ≥ 1. The purpose of the present paper is to collect known results concerning this problem, to investigate what the optimal value in the lower bound could be, and for which special sequences (nk)k ≥ 1 a small value of the limsup in this LIL can be obtained. We formulate three open problems, which could serve as the main targets for future research.
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.