The number of binary rotation words

DOI10.1051/ITA/2014019MaRDI QIDQ2934278zbMATH OpenOpenAlexFDO

Authors

Publication date 12 December 2014

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

rotationSturmian wordssubword complexityrotation wordstotal complexity

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorics on words (68R15)

Abstract: We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be O(n^4). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov in 1982, then independently by Berenstein, Kanal, Lavine and Olson in 1987, Mignosi in 1991, and then with another technique by Berstel and Pocchiola in 1993.

Recommendations

• On the palindromic decomposition of binary words
• The cardinality of factors of infinite binary words for irrational circle rotations
• Characterization of rotation words generated by homeomorphisms on a circle
• On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
• scientific article; zbMATH DE number 512830

Cited in

(2)

• Characterization of rotation words generated by homeomorphisms on a circle
• Enumeration of Rota-Baxter words

This page was built for publication: The number of binary rotation words

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