On the Sum of the Heights of Sturmian Factors

Details On the Sum of the Heights of Sturmian Factors On the Sum of the Heights of Sturmian Factors

2006-11-13

arxiv.org/abs/math/0611365v1

Mathematics

Combinatorics

6 pages, 1 figure

Scientific paper

A binary word is a map W : N --> {0,1}, and the set of factors of W with
length n is F_n(W):={(W(i),W(i+1),...,W(i+n-1)) : i >= 0}. A word is Sturmian
if |F_n(W)|=n+1 for every n>0. We show that the sum of the heights (also known
as hamming weights) of the n+1 factors with length n of a binary Sturmian word
has the same parity as n, independent of W.

Affiliated with

Also associated with

No associations

Rating

On the Sum of the Heights of Sturmian Factors 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 On the Sum of the Heights of Sturmian Factors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Sum of the Heights of Sturmian Factors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669433