On the Sum of the Heights of Sturmian Factors
| dc.creator | O'Bryant, Kevin | |
| dc.date | 2006-11-13 | |
| dc.date.accessioned | 2026-07-07T07:32:49Z | |
| dc.date.available | 2026-07-07T07:32:49Z | |
| dc.description | 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. | |
| dc.description | 6 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0611365 | |
| dc.identifier | http://arxiv.org/abs/math/0611365 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119247 | |
| dc.subject | Combinatorics | |
| dc.subject | 68R15 | |
| dc.title | On the Sum of the Heights of Sturmian Factors | |
| dc.type | text |