Papers
Topics
Authors
Recent
Search
2000 character limit reached

Extremal discrepancy behavior of lacunary sequences

Published 7 Mar 2014 in math.NT, math.CA, and math.PR | (1403.1630v2)

Abstract: In 1975 Walter Philipp proved the law of the iterated logarithm (LIL) for the discrepancy of lacunary sequences: for any sequence $(n_k){k \geq 1}$ satisfying the Hadamard gap condition $n{k+1} / n_k \geq q > 1,~k \geq 1,$ we have $$ \frac{1}{4 \sqrt{2}} \leq \limsup_{N \to \infty} \frac{N D_N({ n_1 x }, \dots, {n_N x})}{\sqrt{2 N \log \log N}} \leq C_q $$ 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 $(n_k){k \geq 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 $(n_k){k \geq 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 $(n_k)_{k \geq 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.