Low of the iterated logarithm in the strassen formulation and additive functions
- 12 Downloads
KeywordsAdditive Function Iterate Logarithm Strassen Formulation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.E. Manstavichyus, “Strong convergence of additive arithmetic functions,” Liet. Mat. Rinkinys,25, No. 2, 127–137 (1985).Google Scholar
- 2.E. Manstavichyus, “Sums of additive arithmetic functions with shifted arguments,” in: Investigations in Number Theory [in Russian], Petrozavodsk State Univ. (1986).Google Scholar
- 3.E. Manstavichyus, “Law of the iterated logarithm for additive functions,” in: Twenty-Fifth Conference of the Lithuanian Mathematical Society. Abstracts of Reports [in Russian], Inst. Mat. Kibern. AN LitSSR, Vilnius (1984), pp. 175–176.Google Scholar
- 4.I. P. Kubilyus, Probabilistic Methods in Number Theory [in Russian], Gos. Izd-vo Polit. Nauchn Lit. LitSSR, Vilnius (1962).Google Scholar
- 5.V. V. Petrov, Sums of Independent Random Variables, Springer-Verlag (1975).Google Scholar
- 6.A. de Acosta, “A new proof of the Hartman-Wintner law of the iterated logarithm,” Ann. Probab.,11, No. 2, 270–276 (1983).Google Scholar
- 7.H. Teicher, “On the law of the iterated logarithm,” Ann. Probab.,2, 714–728 (1974).Google Scholar
- 8.V. A. Egorov, “Strong law of large numbers and law of the iterated logarithm,” Teor. Veroyatn. Primen.,27, No. 1, 84–98 (1972).Google Scholar
- 9.I. Z. Ruzsa, “Effective results in probabilistic number theory,” Budapest: Preprint No. 12 (1982).Google Scholar
- 10.A. I. Martikainen, “Tests for strong convergence of normalized sums of random variables and their application,” Teor. Veroyatn. Primen.,29, No. 3, 502–516 (1984).Google Scholar
© Plenum Publishing Corporation 1986