Abstract
It is proved that two types of discrepancies of the sequence {θ n x} obey the law of the iterated logarithm with the same constant. The appearing constants are calculated explicitly for most of θ > 1.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Berkes, On the asymptotic behaviour of Σ f(n k x). Theorems, II. Applications, Z. Wahr. verv. Geb., 34 (1976), 319–345, 347–365.
K. Fukuyama, The central limit theorem for Riesz-Raikov sums, Prob. Theory Rel. Fields, 100 (1994), 57–75.
B. Petit, Le théorème limite central pour des sommes de Riesz-Raikov, Prob. Theory Relat. Fields, 93 (1992), 407–438.
W. Philipp, Mixing Sequences of Random Variables and Probabilistic Number Theory, Memoris Amer. Math. Soc. 111 (1971).
W. Philipp, Limit theorems for lacunary series and uniform distribution mod 1, Acta Arithmetica, 26 (1975), 241–251.
W. Philipp, A functional law of the iterated logarithm for empirical distribution, functions of weakly dependent random variables, Ann. Probab., 5 (1977), 319–350.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Professor Walter Philipp
Rights and permissions
About this article
Cite this article
Fukuyama, K. The law of the iterated logarithm for discrepancies of {θ n x}. Acta Math Hung 118, 155–170 (2008). https://doi.org/10.1007/s10474-007-6201-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-007-6201-8