Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the asymptotic behavior of weakly lacunary series (1312.0668v2)

Published 3 Dec 2013 in math.NT and math.PR

Abstract: Let $f$ be a measurable function satisfying $$f(x+1)=f(x), \qquad \int_01 f(x) dx=0, \qquad \textrm{Var} ~f < + \infty,$$ and let $(n_k){k\ge 1}$ be a sequence of integers satisfying $n{k+1}/n_k \ge q >1$ $(k=1, 2, \ldots)$. By the classical theory of lacunary series, under suitable Diophantine conditions on $n_k$, $(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 $(n_k){k\ge 1}$ as well, but as Fukuyama (2009) showed, the behavior of $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 $(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)=\sin 2\pi x$ and $(n_k){k\ge 1}$ grows almost exponentially. Finally we prove that, in a suitable statistical sense, for almost all sequences $(n_k){k\ge 1}$ growing faster than polynomially, $(f(n_kx)){k\ge 1}$ has permutation-invariant behavior.

Summary

We haven't generated a summary for this paper yet.