On permutations of Hardy-Littlewood-P\'olya sequences

Abstract

Let H=(q1, … qr) be a finite set of coprime integers and let n1, n2, … denote the multiplicative semigroup generated by 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\ 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 (nk) and the combination of probabilistic and number-theoretic effects results in a unique, highly interesting asymptotic behavior. In particular, the properties of \nkx\ are not permutation invariant, in contrast to i.i.d. behavior. The purpose of this paper is to show that \nkx\ satisfies a strong independence property ("interlaced mixing"), enabling one to determine the precise asymptotic behavior of permuted sums SN (σ)= Σk=1N f(nσ(k) x). As we will see, the behavior of SN(σ) 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…