Constructions of normal numbers with infinite digit sets

Trees (05C05) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Review text

The authors construct normal sequences for Bernoulli shifts on countable alphabets (and thus normal numbers for generalised Lüroth series) with the help of a rooted, labeled, binary probability tree in the following way. For a given monotonically decreasing sequence \((L_d)_{d\ge1}\) with \(\sum_{d=1}^\infty L_d = 1\), let \(p_d = L_d/\sum_{i=d}^\infty L_i\), define the weight of a word \(a_1 \cdots a_k \in \mathbb{N}^k\) recursively by \(W(1) = 1\), \(W(a_1 \cdots a_k 1) = W(a_1 \cdots a_k) p_{a_k}\), \(W(a_1 \cdots a_{k-1} (a_k{+}1)) = W(a_1 \cdots a_k) (1{-}p_{a_k})\), and let \(G(n)\) be the set of words with \(\sum_{i=1}^k a_i = n\), so that \(\sum_{u \in G(n)} W(u) = 1\) for all \(n\). The grandchildren of a word \(a_1 \cdots a_k \in G(n{-}2)\) are the words \(a_1 \cdots a_k11\), \(a_1 \cdots a_k2\), \(a_1 \cdots a_{k-1}(a_k{+}1)1\) and \(a_1 \cdots a_{k-1}(a_k{+}2)\) in \(G(n)\). Consider infinite sequences that are obtained by concatenating, for all \(n\), \((n{-}1)n\) blocks of \((n{-}2)!\) words in \(G(n)\) such that each \(u \in G(n)\) occurs about \(n!W(u)\) times within these \(n!\) words and that each of the blocks contains about \((n{-}2)!W(v)\) grandchildren of \(v\) for all \(v \in G(n{-}2)\). The authors show that such sequences exist and are \(L\)-normal, i.e., each word \(a_1\cdots a_k \in \mathbb{N}^k\) occurs in the sequence with frequency \(L_{a_1} \cdots L_{a_k}\).

Cites work

This page was built for publication: Constructions of normal numbers with infinite digit sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988787)