Sequences with constant number of return words

Details Sequences with constant number of return words Sequences with constant number of return words

2006-08-24

arxiv.org/abs/math/0608603v4

Mathematics

Combinatorics

Scientific paper

An infinite word has the property $R_m$ if every factor has exactly $m$ return words. Vuillon showed that $R_2$ characterizes Sturmian words. We prove that a word satisfies $R_m$ if its complexity function is $(m-1)n+1$ and if it contains no weak bispecial factor. These conditions are necessary for $m=3$, whereas for $m=4$ the complexity function need not be $3n+1$. New examples of words satisfying $R_m$ are given by words related to digital expansions in real bases.

Affiliated with

Also associated with

No associations

Rating

Sequences with constant number of return 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 Sequences with constant number of return words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequences with constant number of return words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-339634