On permutations of Hardy-Littlewood-Pólya sequences

preprint2014arXivOpen access

Abstract

Let H=(q1,…qr){\cal H}=(q_1, \ldots q_r) be a finite set of coprime integers and let n1,n2,…n_1, n_2, \ldots denote the multiplicative semigroup generated by H\cal H 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 {nkx}\{n_kx\} are very similar to those of independent, identically distributed random variables; here {⋅}\{\cdot \} denotes fractional part. However, the behavior of this sequence depends sensitively on the generating elements of (nk)(n_k) and the combination of probabilistic and number-theoretic effects results in a unique, highly interesting asymptotic behavior. In particular, the properties of {nkx}\{n_kx\} are not permutation invariant, in contrast to i.i.d. behavior. The purpose of this paper is to show that {nkx}\{n_kx\} satisfies a strong independence property ("interlaced mixing"), enabling one to determine the precise asymptotic behavior of permuted sums SN(σ)=∑k=1Nf(nσ(k)x)S_N (σ)= \sum_{k=1}^N f(n_{σ(k)} x). As we will see, the behavior of SN(σ)S_N(σ) still follows that of sums of independent random variables, but its growth speed (depending on σσ) is given by the classical Gál function of Diophantine approximation theory. Some examples describing the class of possible growth functions are given.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.