Abelian returns in Sturmian words

DOI10.4204/EPTCS.63.24MaRDI QIDQ5890500zbMATH OpenOpenAlexFDO

Authors Svetlana Puzynina, Luca Q. Zamboni

Publication date 1 March 2016

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.3635, http://www.emis.de/proceedings/Words2011/paper-21.html?WORDS2011.24

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or three abelian returns. In addition, we describe the structure of abelian returns in Sturmian words, and discuss connections between abelian returns and periodicity.

Recommendations

• Abelian returns in Sturmian words
• scientific article; zbMATH DE number 6272378
• Abelian periods of factors of Sturmian words
• A note on abelian returns in rotation words
• Enumerating abelian returns to prefixes of Sturmian words

Cited in

(7)

• Abelian closures of infinite binary words
• Abelian-square-rich words
• A note on abelian returns in rotation words
• Enumerating abelian returns to prefixes of Sturmian words
• scientific article; zbMATH DE number 6272378 (Why is no real title available?)
• Abelian returns in Sturmian words
• A characterization of Sturmian words by return words

This page was built for publication: Abelian returns in Sturmian words

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