Inflation word entropy for semi-compatible random substitutions (Q2173231)

The author deals with the notion of inflation word entropy for random substitutions with a constant and primitive substitution matrix. Let us define \(\ell _m=\{\ell _{m,1},\dots,\ell _{m,n}\}^{T}\) and \(q _m=\{q _{m,1},\dots,q_{m,n}\}^{T}\), where \(\ell _{m,i}=|\vartheta^m(a_i)|_{\ell}\) and \(q_{m,1}=\log(\#\vartheta^m(a_i))\) for all \(1\leq i \leq n\) and \(m\in \mathbb{N}\). The upper and lower inflation word entropy of type \(i\) for \(1\leq i \leq n\) are given by \(\underline{s}_i^l=\underset{m\rightarrow \infty }{\lim \inf }\frac{q_{m,i}}{\ell_{m,i}}\) and \(\overline{s}_i^l=\underset{m\rightarrow \infty}{\lim \sup}\frac{q_{m,i}}{\ell_{m,i}}\). The author defines the inflation word entropy as \(s^l=\lim_{m\rightarrow \infty } \frac{q_{m,i}}{\ell _{m,i}}\log(\#\vartheta^m(a_i))\). He proves that the inflation word entropy equals the topological entropy \(s\). The author investigates a lot of examples and applications. A closed formula for the topological entropy is given. The author shows that the topological entropy can be constructed from the growth rate of periodic elements, provided that there is at least one periodic element in the subshift \(\mathbb{X}\) that is associated with the random substitution. Given a language \(\mathcal{L}\), the set of periodic words of period \(q\) is given by \(\mathcal{P}(q) = \{u\in \mathcal{L} | |u|= q,\ \text{with }\ u^{N}\in \mathcal{L}, \text{for all}\ N\in \mathbb{N}\}\), where \(u^{N} = u \cdots u\) denotes the concatenation of \(N\) copies of the word \(u\). The author proves that the topological entropy of a primitive semi-compatible random substitution can be obtained from its sets of periodic words via \(s=\underset{q\rightarrow \infty }{\lim \sup }\frac{1}{q}\log (\#\mathcal{P}(q)).\)