Digital sum problems and substitutions on a finite alphabet (Q1179021)

Continuing their previous work [see the first author, Sémin. Théor. Nombres, Univ. Bordeaux I 1987-1988, Exp. No. 39 (1988; Zbl 0718.11008); Number Theory and physics, Springer Proc. Phys. 47, 185-194 (1990; Zbl 0718.11009); the authors, Theor. Comput. Sci. 65, 153-169 (1989; Zbl 0679.10010)], the authors study the sum \(S(N)=\sum_{n<N}\sum_{i\leq n}f(u_ i)\), where \((u_ i)_{i\geq0}\) is a fixed point of a substitution on a finite alphabet, and f a map from \(A\) to \(\mathbb{R}\). They prove the asymptotic formula \(S(N)=\alpha N\log N/\log \theta+NF(N)+o(N)\), in the case where the second largest eigenvalue of the matrix of the substitution is equal to one (with some extra hypotheses): here F is a continuous nowhere differentiable (if \(\alpha\neq0\)) multiplicatively periodic function. Then the authors study the sum \(\sum_{n<N}s(n)\), where \(s(n)\) is the sum of digits function with respect to the numeration system associated to the given substitution.