The law of the iterated logarithm for the discrepancies of a permutation of \(\{n_kx\}\) (Q1046785)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5651869
Language Label Description Also known as
default for all languages
No label defined
    English
    The law of the iterated logarithm for the discrepancies of a permutation of \(\{n_kx\}\)
    scientific article; zbMATH DE number 5651869

      Statements

      The law of the iterated logarithm for the discrepancies of a permutation of \(\{n_kx\}\) (English)
      0 references
      0 references
      28 December 2009
      0 references
      \textit{I. Berkes, W. Philipp} and \textit{R. F. Tichy} [Dev. Math. 16, 95--105 (2008; Zbl 1213.11152)] proved, assuming Hadamard's gap condition that the well known asymptotic property of a sequence \((n_kx)\) is permutation invariant, see Erdős-Gál conjecture solved by \textit{W. Philipp} [Ann. Prob. 5, 319--350 (1977; Zbl 0362.60047)]. The author proves that the values of limsup itself are not permutation-invariant. For any unbounded sequence of natural numbers \(n_k\) (a more general version holds for positive real numbers \(n_k\)) there exists a permutation with \(\limsup=1/2\), almost everywhere.
      0 references
      discrepancies
      0 references
      law of the iterated logarithm
      0 references

      Identifiers