A note on abelian returns in rotation words

DOI10.1016/j.tcs.2014.01.033zbMath1295.68179OpenAlexW2020031747MaRDI QIDQ2437858

Narad Rampersad, Michel Rigo, Pavel Salimov

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.033

zbMATH Keywords

Sturmian wordabelian complexitythree gap theoremrotation wordabelian equivalentabelian return

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Abelian combinatorics on words: a survey ⋮ Relations on words

Cites Work

• Unnamed Item
• Unnamed Item
• Reversible Christoffel factorizations
• Rotation encoding and self-similarity phenomenon
• Balances for fixed points of primitive substitutions.
• Three distance theorems and combinatorics on words
• Abelian complexity of minimal subshifts
• Combinatoire des codages de rotations
• On a conjecture of Erdös and Szüsz related to uniform distribution mod 1
• Abelian returns in Sturmian words

This page was built for publication: A note on abelian returns in rotation words