Computing the number of cubic runs in standard Sturmian words

Abstract

a b s t r a c tThe standard Sturmian words (standard words in short) are extensively studied in combinatorics of words. They are complicated enough to have many interesting properties, and, at the same time, due to their recurrent structure, they are highly compressible. In this paper, we present compact formulas for the number of cubic runs in any standard word w (denoted by ρ (3) (w)). We show also thatis the golden ratio, and present a sequence of strictly growing standard words achieving this limit. The exact asymptotic ratio here is irrational, contrary to the situation of squares and runs in the same class of words. Furthermore, we design an efficient algorithm for computing the number of cubic runs in standard words in linear time with respect to the size of a directive sequence, i.e., the compressed representation describing the word (recurrences). The explicit size of a word can be exponential with respect to this representation, and hence this is yet another example of a very fast computation on highly compressible texts.

The Maximal Number of Runs in Standard Sturmian Words

“…The words of the type b can be considered similarly and all the results hold. For more interesting facts related to combinatorial structure of standard words see for instance in [1], [2], [13], [14] and [15].…”