Let be a finite set of coprime integers and let denote the multiplicative semigroup generated by and arranged in increasing order. The distribution of such sequences has been studied intensively in number theory and they have remarkable probabilistic and ergodic properties. For example, the asymptotic properties of the sequence are very similar to those of independent, identically distributed random variables; here denotes fractional part. However, the behavior of this sequence depends sensitively on the generating elements of and the combination of probabilistic and number-theoretic effects results in a unique, highly interesting asymptotic behavior. In particular, the properties of are not permutation invariant, in contrast to i.i.d. behavior. The purpose of this paper is to show that satisfies a strong independence property (“interlaced mixing”), enabling one to determine the precise asymptotic behavior of permuted sums $S_N (\sigma)= \sum_{k=1}^N f(n_{\sigma(k)} x)S_N(\sigma)$ still follows that of sums of independent random variables, but its growth speed (depending on ) is given by the classical G'al function of Diophantine approximation theory. Some examples describing the class of possible growth functions are given.

生成讲解博客的中文版本

生成AI智能校验的中文版本