##
###
Abelian powers and repetitions in Sturmian words

Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Jarkko Peltomäki, Élise Prieur-Gaston

2016
*
Theoretical Computer Science
*

Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent k for every k > 0. We improve on this result by studying the maximum exponents of abelian powers and abelian repetitions (an abelian repetition is an analogue of a fractional power) in Sturmian words. We give a formula for computing the maximum exponent of an abelian power of abelian period m starting at a given position in any Sturmian word of
## more »

... tation angle α. By considering all possible abelian periods m, we recover the result of Richomme, Saari and Zamboni. As an analogue of the critical exponent, we introduce the abelian critical exponent A(s α) of a Sturmian word sα of angle α as the quantity A(sα) = lim sup km/m = lim sup k m /m, where km (resp. k m ) denotes the maximum exponent of an abelian power (resp. of an abelian repetition) of abelian period m (the superior limits coincide for Sturmian words). We show that A(s α) equals the Lagrange constant of the number α. This yields a formula for computing A(sα) in terms of the partial quotients of the continued fraction expansion of α. Using this formula, we prove that A(sα) ≥ √ 5 and that the equality holds for the Fibonacci word. We further prove that A(sα) is finite if and only if α has bounded partial quotients, that is, if and only if sα is β-power-free for some real number β. Concerning the infinite Fibonacci word, we prove that: i) The longest prefix that is an abelian repetition of period F j , j > 1, has length Fj(Fj+1 + Fj−1 + 1) − 2 if j is even or Fj(Fj+1 + Fj−1) − 2 if j is odd, where Fj is the jth Fibonacci number; ii) The minimum abelian period of any factor is a Fibonacci number. Further, we derive a formula for the minimum abelian periods of the finite Fibonacci words: we prove that for j ≥ 3 the Fibonacci word f j , of length Fj, has minimum abelian period equal to F j/2 if j = 0, 1, 2 mod 4 or to F 1+ j/2 if j = 3 mod 4.

doi:10.1016/j.tcs.2016.04.039
fatcat:nxke73lqu5ctzlwt23jk7gawwe