Abelian Repetitions in Sturmian Words [chapter]

Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston
2013 Lecture Notes in Computer Science  
We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of elementary Number Theory. If km denotes the maximal exponent of an abelian repetition of period m, we prove that lim sup km/m ≥ √ 5 for any Sturmian word, and the equality holds for the Fibonacci infinite word. We further prove that the longest prefix of the
more » ... ibonacci infinite word that is an abelian repetition of period Fj, 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. This allows us to give an exact formula for the smallest abelian periods of the Fibonacci finite words. More precisely, we prove that for j ≥ 3, the Fibonacci word fj has abelian period equal to Fn, where n = j/2 if j = 0, 1, 2 mod 4, or n = 1 + j/2 if j = 3 mod 4.
doi:10.1007/978-3-642-38771-5_21 fatcat:u7br3sk5mba5bcymopm3lzezzy