English

On the asymptotic behavior of weakly lacunary series

Number Theory 2014-01-13 v2 Probability

Abstract

Let ff be a measurable function satisfying f(x+1)=f(x),01f(x)dx=0,Var f<+,f(x+1)=f(x), \qquad \int_0^1 f(x) dx=0, \qquad \textrm{Var} ~f < + \infty, and let (nk)k1(n_k)_{k\ge 1} be a sequence of integers satisfying nk+1/nkq>1n_{k+1}/n_k \ge q >1 (k=1,2,)(k=1, 2, \ldots). By the classical theory of lacunary series, under suitable Diophantine conditions on nkn_k, (f(nkx))k1(f(n_kx))_{k\ge 1} satisfies the central limit theorem and the law of the iterated logarithm. These results extend for a class of subexponentially growing sequences (nk)k1(n_k)_{k\ge 1} as well, but as Fukuyama (2009) showed, the behavior of f(nkx)f(n_kx) is generally not permutation-invariant, e.g. a rearrangement of the sequence can ruin the CLT and LIL. In this paper we construct an infinite order Diophantine condition implying the permutation-invariant CLT and LIL without any growth conditions on (nk)k1(n_k)_{k\ge 1} and show that the known finite order Diophantine conditions in the theory do not imply permutation-invariance even if f(x)=sin2πxf(x)=\sin 2\pi x and (nk)k1(n_k)_{k\ge 1} grows almost exponentially. Finally we prove that, in a suitable statistical sense, for almost all sequences (nk)k1(n_k)_{k\ge 1} growing faster than polynomially, (f(nkx))k1(f(n_kx))_{k\ge 1} has permutation-invariant behavior.

Keywords

Cite

@article{arxiv.1312.0668,
  title  = {On the asymptotic behavior of weakly lacunary series},
  author = {Christoph Aistleitner and Istvan Berkes and Robert Tichy},
  journal= {arXiv preprint arXiv:1312.0668},
  year   = {2014}
}