Abelian returns in Sturmian words

Details Abelian returns in Sturmian words Abelian returns in Sturmian words

2012-04-25

arxiv.org/abs/1204.5755v1

Mathematics

Combinatorics

Scientific paper

Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of return word, each of them gives rise to a new characterization of Sturmian words. We prove that a recurrent infinite word is Sturmian if and only if each of its factors has two or three abelian (or semi-abelian) returns. We study the structure of abelian returns in Sturmian words and give a characterization of those factors having exactly two abelian returns. Finally we discuss connections between abelian returns and periodicity in words.

Affiliated with

Also associated with

No associations

Rating

Abelian returns in Sturmian words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abelian returns in Sturmian words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abelian returns in Sturmian words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-312844