Central Limit Theorem for probability measures defined by sum-of-digits function in base 2

Abstract

In this paper we prove a central limit theorem for some probability measures defined as asymtotic densities of integer sets defined via sum-of-digit-function. To any integer a we can associate a measure on Z called $\mu$a such that, for any d, $\mu$a(d) is the asymptotic density of the set of integers n such that s\_2(n + a) -- s\_2(n) = d where s\_2(n) is the number of digits "1" in the binary expansion of n. We express this probability measure as a product of matrices. Then we take a sequence of integers (a\_X(n)) n$\in$N via a balanced Bernoulli process. We prove that, for almost every sequence, and after renormalization by the typical variance, we have a central limit theorem by computing all the moments and proving that they converge towards the moments of the normal law N (0, 1).

Annali della Scuola Normale Superiore di Pisa, A Para{î}tre

References in corpus (1)

• Integer Addition and Hamming Weight

Cited by in corpus (3)

• A lower bound for Cusick's conjecture on the digits of n+t
• Divisibility of binomial coefficients by powers of two
• A central limit theorem for the variation of the sum of digits