  Abelian repetition threshold ART(k) is the number separating fractional
Abelian powers which are avoidable and unavoidable over the k-letter alphabet.
The exact values of ART(k) are unknown; the lower bounds were proved in [A.V.
Samsonov, A.M. Shur. On Abelian repetition threshold. RAIRO ITA, 2012] and
conjectured to be tight. We present a method of study of Abelian power-free
languages using random walks in prefix trees and some experimental results
obtained by this method. On the base of these results, we conjecture that the
lower bounds for ART(k) by Samsonov and Shur are not tight for all k except for
k=5 and prove this conjecture for k=6,7,8,9,10. Namely, we show that ART(k) >
(k-2)/(k-3) in all these cases.
