Abstract
The class of (eventually) dendric words generalizes well-studied families such as the Sturmian words, the Arnoux–Rauzy words or the codings of interval exchanges. Dendricity is also a particular case of neutrality. We show that, however, the notions of eventual dendricity and eventual neutrality coincide. This paper then focuses on two questions linking dendricity and morphisms. We first look at the evolution of the factor complexity when applying a non-erasing morphism to an eventually dendric word and show that it can only grow by an additive constant. We next generalize a result known for Sturmian words and consider the morphisms that preserve dendricity for all dendric words. We show that they correspond exactly to the morphisms generated by the Arnoux-Rauzy morphisms.
Similar content being viewed by others
Data availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
Notes
Note that this is not true if \(b' \ne c'\) and we are on an alphabet of size 2.
References
Berthé, V., Cecchi Bernales, P., Durand, F., Leroy, J., Perrin, D., Petite, S.: On the dimension group of unimodular \({\cal{S}}\)-adic subshifts. Monatsh. Math. 194(4), 687–717 (2021)
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: Acyclic, connected and tree sets. Monatsh. Math. 176(4), 521–550 (2015)
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: Maximal bifix decoding. Discrete Math. 338(5), 725–742 (2015)
Berthé, V., Dolce, F., Durand, F., Leroy, J., Perrin, D.: Rigidity and substitutive dendric words. Internat. J. Found. Comput. Sci. 29(5), 705–720 (2018)
Cassaigne, J., Nicolas, F.: Factor complexity. In Combinatorics, Automata and Number Theory, volume 135 of Encyclopedia Math. Appl., pages 163–247. Cambridge Univ. Press, Cambridge, (2010)
Damron, M., Fickenscher, J.: The number of ergodic measures for transitive subshifts under the regular bispecial condition. Ergod. Theory Dyn. Syst. 42(1), 86–140 (2022)
Dolce, F., Perrin, D.: Eventually dendric shift spaces. Ergod. Theory Dyn. Syst. 41(7), 2023–2048 (2021)
Ferenczi, S., Zamboni, L.Q.: Languages of \(k\)-interval exchange transformations. Bull. Lond. Math. Soc. 40(4), 705–714 (2008)
Gheeraert, F., Lejeune, M., Leroy, J.: \({\cal{S} }\)-adic characterization of minimal ternary dendric shifts. Ergod. Theory Dyn. Syst. 42(11), 3393–3432 (2022)
Gheeraert, F., Leroy, J.: \({\cal{S}}\)-adic characterization of minimal dendric shifts, (2022). arXiv:2206.00333
Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theor. Comput. Sci. 276(1–2), 281–313 (2002)
Keane, M.: Interval exchange transformations. Math. Z. 141, 25–31 (1975)
Lothaire, M.: Algebraic combinatorics on words, volume 90 of Encycl. Math. Appl. Cambridge: Cambridge University Press, (2002)
Rauzy, G.: Échanges d’intervalles et transformations induites. Acta Arith. 34(4), 315–328 (1979)
Acknowledgements
The author is supported by an FNRS Research Fellow grant. The author would like to thank Julien Leroy for discussions about the results of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by H. Bruin.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Gheeraert, F. Some properties of morphic images of (eventually) dendric words. Monatsh Math 202, 335–351 (2023). https://doi.org/10.1007/s00605-023-01877-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-023-01877-4