Abelian powers and repetitions in Sturmian words

作者：Fici Gabriele; Langiu Alessio; Lecroq Thierry; Lefebvre Arnaud; Mignosi Filippo; Peltomaki Jarkko; Prieur Gaston Elise

来源：Theoretical Computer Science, 2016, 635: 16-34.

DOI：10.1016/j.tcs.2016.04.039

• Sturmian word
• Abelian power
• Abelian period
• Lagrange constant
• Critical exponent

Richomme, Saari and Zamboni (2011) [39] 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 rotation angle alpha. 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(alpha)) of a Sturmian word s(alpha) of angle alpha as the quantity A(s(alpha)) = lim sup k(m)/m = lim sup k'(m)/m, where k(m) (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(alpha)) equals the Lagrange constant of the number alpha. This yields a formula for computing A(s(alpha)) in terms of the partial quotients of the continued fraction expansion of alpha. Using this formula, we prove that A(s(alpha)) >= root 5 and that the equality holds for the Fibonacci word. We further prove that A(s(alpha)) is finite if and only if alpha has bounded partial quotients, that is, if and only if s(alpha) is beta-power-free for some real number beta.
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 F-j(Fj+1 + Fj-1 + 1) - 2 if j is even or F-j(Fj+1 + Fj-1) - 2 if j is odd, where F-j 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 F-j, has minimum abelian period equal to F-left perpendicularj/2right perpendicular if j = 0, 1, 2 mod 4 or to F1+left perpendicularj/2right perpendicular if j = 3 mod 4.

• 出版日期2016-7-4