S-adic characterization of minimal dendric shifts
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.
- -adic characterization of minimal ternary dendric shifts
- A characterization of substitutive sequences using return words
- Acyclic, connected and tree sets
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- Beyond substitutive dynamical systems: S-adic expansions
- Bifix codes and interval exchanges
- Decidability of the HD0L ultimate periodicity problem
- Decidability of uniform recurrence of morphic sequences
- Do the properties of an S-adic representation determine factor complexity?
- Eventually dendric shift spaces
- Factor complexity
- scientific article; zbMATH DE number 3244887 (Why is no real title available?)
- Interplay between finite topological rank minimal Cantor systems, S-adic subshifts and their complexity
- Interval exchanges, admissibility and branching Rauzy induction
- Languages of k -interval exchange transformations
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Maximal bifix decoding
- On the automorphism group of minimal \(\mathcal{S}\)-adic subshifts of finite alphabet rank
- On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts
- Rank and symbolic complexity
- Représentation géométrique de suites de complexité 2n+1
- Rigidity and substitutive dendric words
- SMALL DENOMINATORS AND PROBLEMS OF STABILITY OF MOTION IN CLASSICAL AND CELESTIAL MECHANICS
- Substitutions in dynamics, arithmetics and combinatorics
- Symbolic dynamics II. Sturmian trajectories.
- The finite index basis property
- The number of ergodic measures for transitive subshifts under the regular bispecial condition
- Tower power for S-adics
- Échanges d'intervalles et transformations induites
This page was built for publication: \(\mathcal{S}\)-adic characterization of minimal dendric shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986825)
