On the law of the iterated logarithm for permuted lacunary sequences

preprint2014arXivOpen access

Abstract

It is known that for any smooth periodic function ff the sequence (f(2kx))k≥1(f(2^kx))_{k\ge 1} behaves like a sequence of i.i.d.\ random variables, for example, it satisfies the central limit theorem and the law of the iterated logarithm. Recently Fukuyama showed that permuting (f(2kx))k≥1(f(2^kx))_{k\ge 1} can ruin the validity of the law of the iterated logarithm, a very surprising result. In this paper we present an optimal condition on (nk)k≥1(n_k)_{k\ge 1}, formulated in terms of the number of solutions of certain Diophantine equations, which ensures the validity of the law of the iterated logarithm for any permutation of the sequence (f(nkx))k≥1(f(n_k x))_{k \geq 1}. A similar result is proved for the discrepancy of the sequence ({nkx})k≥1(\{n_k x\})_{k \geq 1}, where {⋅}\{ \cdot \} denotes fractional part.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.