On non-repetitive complexity of Arnoux-Rauzy words

DOI10.1016/J.DAM.2020.06.016zbMath1476.68221arXiv2002.12593OpenAlexW3037135888MaRDI QIDQ2197452

Élise Vandomme, Kateřina Medková, Edita Pelantová

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.12593

zbMATH Keywords

Arnoux-Rauzy wordfactor complexitydirective sequencenon-repetitivity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents

Cites Work

• Initial non-repetitive complexity of infinite words
• Substitutions in dynamics, arithmetics and combinatorics
• Eulerian entropy and non-repetitive subword complexity
• Limit values of the recurrence quotient of Sturmian sequences
• Episturmian words and episturmian morphisms
• Derived sequences of Arnoux-Rauzy sequences
• Acyclic, connected and tree sets
• Recurrence functions of Arnoux-Rauzy sequences, and answer to a question of Morse and Hedlund
• Return words in Sturmian and episturmian words
• BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS
• Sturmian jungle (or garden?) on multiliteral alphabets
• Représentation géométrique de suites de complexité $2n+1$
• A generalization of Sturmian sequences: Combinatorial structure and transcendence
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• Rigidity and Substitutive Dendric Words
• Episturmian words: a survey

This page was built for publication: On non-repetitive complexity of Arnoux-Rauzy words