Abelian returns in Sturmian words
Svetlana Puzynina (University of Turku, Finland, and Sobolev Institute, of Mathematics, Novosibirsk, Russia), Luca Q. Zamboni (Universite de Lyon,, France, and University of Turku, Finland)

TL;DR
This paper introduces an abelian perspective on return words in Sturmian words, providing a new characterization based on the number of abelian returns per factor and exploring their structural properties.
Contribution
It offers a novel characterization of Sturmian words through abelian returns, linking combinatorial properties with abelian structures.
Findings
Sturmian words have factors with two or three abelian returns.
A new characterization of Sturmian words based on abelian returns.
Connections between abelian returns and periodicity are discussed.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Authorship Attribution and Profiling · Language and cultural evolution
