Periodic points in random substitution subshifts (Q2006797): Difference between revisions

The author deals with the problem of existence and enumeration of shift-periodic points. Various aspects of periodic points for random substitution subshifts are investigated. A new property for random substitutions, called disjoint images property, is introduced. The author studies sufficient and necessary conditions for the existence of periodic points in random substitution subshifts. Let \(\vartheta\) be a random substitution for which \(u,v \in \vartheta\) implies that \(|u|=|v|\) for all \(a\in \mathcal{A}\), where \(\mathcal{A} = \{a_1, \ldots, a_d \}\) is a finite alphabet whose elements are referred to as letters. In this case the author proves that there is a decidable procedure to determine if \(\vartheta\) has disjoint images or not. Let \(\vartheta\) be a compatible random substitution with disjoint images. The author shows that there is a decidable procedure to determine whether the word \(u\) is a prime periodic block for an element of Per\((X_{\vartheta})\), where \(X_{\vartheta}\) is the random substitution subshift of \(\vartheta\) (RS-subshift).