2020/08/12 by Rosenfeld, Matthieu
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.2008.05192
We study the growth rate of some power-free languages. For any integer k and real β>1, we let α(k,β) be the growth rate of the number of β-free words of a given length over the alphabet \1,2,…, k\. Shur studied the asymptotic behavior of α(k,β) for β≥2 as k goes to infinity. He suggested a conjecture regarding the asymptotic behavior of α(k,β) as k goes to infinity when 1