On non-repetitive complexity of Arnoux-Rauzy words

DOI10.1016/J.DAM.2020.06.016MaRDI QIDQ2197452zbMATH OpenOpenAlexFDO

Authors Kateřina Medková, Élise Vandomme, 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 worddirective sequencefactor complexitynon-repetitivity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: The non-repetitive complexity $$ and the initial non-repetitive complexity $$ are functions which reflect the structure of the infinite word $$ with respect to the repetitions of factors of a given length. We determine $$ for the Arnoux-Rauzy words and $$ for the standard Arnoux-Rauzy words. Our main tools are $S$-adic representation of Arnoux-Rauzy words and description of return words to their factors. The formulas we obtain are then used to evaluate $$ and $$ for the $d$-bonacci word.

Recommendations

• Initial non-repetitive complexity of infinite words
• On the number of Arnoux-Rauzy words
• Words with unbounded periodicity complexity
• On the character of words of sublinear complexity
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm

Cites work

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

Cited in

(3)

• On the number of Arnoux-Rauzy words
• Initial non-repetitive complexity of infinite words
• Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197452)