Article contents
$\mathcal{\textbf{S}}$-adic characterization of minimal ternary dendric shifts
Published online by Cambridge University Press:Â 02 September 2021
Abstract
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, ArnouxâRauzy shifts and codings of interval exchange transformations. It is known that any minimal dendric shift has a primitive
$\mathcal {S}$
-adic representation where the morphisms in
$\mathcal {S}$
are positive tame automorphisms of the free group generated by the alphabet. In this paper, we investigate those
$\mathcal {S}$
-adic representations, heading towards an
$\mathcal {S}$
-adic characterization of this family. We obtain such a characterization in the ternary case, involving a directed graph with two vertices.
MSC classification
- Type
- Original Article
- Information
- Copyright
- © The Author(s), 2021. Published by Cambridge University Press
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2160.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2161.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2162.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2163.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2164.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2165.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2166.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2167.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2168.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2169.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2170.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20221006024603619-0770:S0143385721000845:S0143385721000845_inline2171.png?pub-status=live)
- 3
- Cited by