Caractérisation des ensembles normaux substitutifs. (Characterization of normal substitutional sets) (Q1115908)

Let \(u:=(u_ n)_{n\geq 0}\), be a given sequence of real numbers and define the normal set B(u) of u as the set of real numbers x such that the sequence \((xu_ n)_ n\) is uniformly distributed modulo 1. This definition is due to \textit{M. Mendès France} [Acta Arith. 15, 189-192 (1969; Zbl 0177.072)]. From a result of \textit{A. Zame} [Acta Arith. 20, 147-154 (1972; Zbl 0242.10031)] for every countable-dimensional vector space E over \({\mathbb{Q}}\) that contains \({\mathbb{Q}}\), there exists a strictly increasing sequence u of integers such that \(B(u)={\mathbb{R}}\setminus E.\) The author proves (Theorem 2) that E is an algebraic extension of finite degree over \({\mathbb{Q}}\) if and only if there exists a sequence of integers u generated by an irreducible substitution \(\Sigma\) over a finite alphabet A (in other words, \(\Sigma\) has a connected graph and u is given by the sequence of rank where a given letter occurs in an infinite word \(w:=w_ 0w_ 1w_ 2,...,w_ i\in A\), such that if we replace each \(w_ i\) by the word \(\Sigma (w_ i)\), we still get w). Moreover for such a sequence u, let E(u) be the set of real numbers x satisfying for some integer k, \(\lim_{n\to \infty}e^{2\pi i\ell_ a(n)x}=1\) for all \(a\in A\), where \(\ell_ a(n)\) is the number of letters (length) of the word \(\Sigma^ n(a)\). Then (Proposition 1) \(B(u)={\mathbb{R}}\setminus E\). The sequence u in the above theorem is exhibited from a matrix whose entries are strictly positive integers and the minimal polynomial is that of a Pisot-Vijayaraghavan number \(\theta\) such that \(E={\mathbb{Q}}(\theta)\).