2000 character limit reached
Abelian returns in Sturmian words (1108.3635v1)
Published 18 Aug 2011 in cs.FL, cs.DM, and math.CO
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.