← All problems

Erdős Problem #995 — Lacunary systems and the law of the iterated logarithm

62 years old · traced to

Let (nk)k≥1(n_k)_{k\ge1} be a sequence of positive integers satisfying the Hadamard gap condition: for some fixed q>1q>1, nk+1/nk≥qn_{k+1}/n_k\ge q for every kk. Let f∈L2([0,1])f\in L^2([0,1]), evaluated periodically, and let {x}=x−⌊x⌋\{x\}=x-\lfloor x\rfloor denote fractional part. For Lebesgue-almost every α∈[0,1]\alpha\in[0,1], study the growth as N→∞N\to\infty of

SN(α)=∑k=1Nf({αnk}).S_N(\alpha)=\sum_{k=1}^N f(\{\alpha n_k\}).

In particular, is it true for every such sequence and every such ff that

SN(α)=o ⁣(Nlog⁡log⁡N)for almost every α?S_N(\alpha)=o\!\left(N\sqrt{\log\log N}\right) \quad\text{for almost every }\alpha?

The little-oo assertion means that the quotient by Nlog⁡log⁡NN\sqrt{\log\log N} tends to zero as N→∞N\to\infty. Erdős Problem #995 Diophantine conditions in the law of the iterated logarithm for lacunary systems

Background

Lacunary sums are often compared with sums of independent random variables: large gaps between frequencies can produce Gaussian limit laws and iterated-logarithm behavior. But for sums of general dilates f(nkx)f(n_kx), the terms need not behave independently. Their correlations can reflect arithmetic relations among the frequencies; in Fourier-based arguments, these relations lead to counting solutions of linear Diophantine equations involving the nkn_k. Thus conclusions for trigonometric polynomials or functions of bounded variation need not automatically extend to arbitrary L2L^2 functions. Diophantine conditions in the law of the iterated logarithm for lacunary systems Aistleitner, Berkes, and Tichy, Lacunary Sequences in Analysis, Probability and Number Theory

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.