On the number of Arnoux-Rauzy words

DOI10.4064/AA101-2-4MaRDI QIDQ2773325zbMATH OpenOpenAlexFDO

Authors Filippo Mignosi, Luca Q. Zamboni

Publication date 21 February 2002

Published in Acta Arithmetica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4064/aa101-2-4

zbMATH Keywords

\(k\)-letter alphabetArnoux-Rauzy sequencesblock-complexityfactors of Sturmian sequencesgeneralized Euler functionnumber of subwordsrecurrent sequences

Mathematics Subject Classification ID

Automata sequences (11B85) Symbolic dynamics (37B10) Combinatorics on words (68R15)

Review text

The authors study the so-called Arnoux-Rauzy sequences: these are the recurrent sequences over a \(k\)-letter alphabet that have block-complexity \((k-1)n+1\) and exactly one right- and one left-special factor of each length. These sequences were introduced for \(k=3\) by \textit{P. Arnoux} and \textit{G. Rauzy} [Bull. Soc. Math. Fr. 119, 199-215 (1991; Zbl 0789.28011)] and for \(k\geq 4\) by \textit{R. N. Risley} and \textit{L. Q. Zamboni} [Acta Arith. 95, 167-184 (2000; Zbl 0953.11007)]. They generalize the Sturmian sequences that correspond to \(k=2\). NEWLINENEWLINENEWLINEThe authors obtain a formula for the number of all subwords (factors) of all Arnoux-Rauzy sequences for a fixed \(k\). This formula involves a generalized Euler function. It boils down to the formula for all factors of Sturmian sequences for \(k=2\), originally conjecture by \textit{S. Dulucq} and \textit{D. Gouyou-Beauchamps} [Theor. Comput. Sci. 71, 381-400 (1990; Zbl 0694.68048)] and first proved by \textit{F. Mignosi} [Theor. Comput. Sci. 82, 71-84 (1991; Zbl 0728.68093)]. NEWLINENEWLINENEWLINENote that Reference [9] has appeared [\textit{N. Chekhova, P. Hubert} and \textit{A. Messaoudi}, J. Théor. Nombres Bordx. 13, 371-394 (2001; Zbl 1038.37010)].

Recommendations

• Frequencies of factors in Arnoux–Rauzy sequences
• On non-repetitive complexity of Arnoux-Rauzy words
• A generalization of Sturmian sequences: Combinatorial structure and transcendence
• Derived sequences of Arnoux-Rauzy sequences
• RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS

Cited in

(17)

• On graphs of central episturmian words
• On non-repetitive complexity of Arnoux-Rauzy words
• Derived sequences of Arnoux-Rauzy sequences
• Open and closed factors in Arnoux-Rauzy words
• Characterizations of finite and infinite episturmian words via lexicographic orderings
• A palindromization map on free monoids
• Which Arnoux-Rauzy Words Are 2-Balanced?
• Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion
• Sturmian and Episturmian Words
• On a Family of Morphic Images of Arnoux-Rauzy Words
• A generalization of Sturmian sequences: Combinatorial structure and transcendence
• Episturmian morphisms and a Galois theorem on continued fractions
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
• COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
• Episturmian words: a survey
• Number of Words Characterizing Digital Balls on the Triangular Tiling
• On the number of episturmian palindromes

This page was built for publication: On the number of Arnoux-Rauzy words

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