Abelian repetitions in Sturmian words

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 k m denotes the maximal exponent of an abelian repetition of period m, we prove that limsup 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 Fibonacci infinite word that is an abelian repetition of period F j , j > 1, has length F j ( F j + 1 + F j - 1 + 1) - 2 if j is even or F j ( F j + 1 + F j - 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 f j has abelian period equal to F n , where n=?j/2? if j=0,1,2mod4, or n=1+?j/2? if j=3mod4.