\(\mathcal{S}\)-adic characterization of minimal dendric shifts (Q6986825)

This paper provides a graph-based \(\mathfrak{S}\)-adic characterization of dendric shifts, which generalize classical families like Sturmian and Arnoux-Rauzy shifts. The main contribution is a decidability procedure for determining when uniformly recurrent morphic words generate (eventually) dendric shift spaces. The combinatorial approach is technically sound and offers concrete criteria through two finite graphs. While computationally aspects could be further developed, the work represents a valuable advancement in symbolic dynamics with applications to combinatorics on words. Let \(\mathfrak{S}\) be a family of dendric return morphisms from \(\mathcal{A}^*\) to \(\mathcal{A}^*\) and let \(X\) be a shift space having an \(\mathfrak{S}\)-adic representation \(\boldsymbol{\sigma} = (\sigma_n)_{n \geq 0}\). Then, the authors prov that \(X\) is minimal dendric if and only if \(\boldsymbol{\sigma}\) is primitive and labels infinite paths in the graphs \(\mathcal{G}^L(\mathfrak{S})\) and \(\mathcal{G}^R(\mathfrak{S})\). The authors introduce new graphs associated with a shift space, providing another characterization of dendric shift spaces. They also study the link with eventual dendricity. The authors focus on the sub-family of interval exchanges and provide a \(\mathfrak{S}\)-adic characterization using a subgraph of the graph obtained in the dendric case.