Recognition: unknown
Abelian returns in Sturmian words
classification
💻 cs.FL
cs.DMmath.CO
keywords
abelianreturnssturmianwordswordadditioncharacterizationconnections
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.