Critical exponents of infinite balanced words (Q2422043)

Using a construction of \textit{P. Hubert} [Theor. Comput. Sci. 242, No. 1--2, 91--108 (2000; Zbl 0944.68149], the authors produce infinite balanced words \(x_k\) over \(k\) letters for \(k=3,4,\dots,10\). They prove that the word \(x_3\) has critical exponent \(2+\frac{\sqrt{2}}2\) (Propositon 6), which is the least possible critical exponent for infinite balanced words over 3 letters (Proposition 7). Similarly, the word \(x_4\) has critical exponent \(\frac{5+\sqrt{5}}4\approx 1.8090\) (Propositon 9); on the other hand, via a backtracking algorithm, the authors have verified that the least possible critical exponent for infinite balanced words over 4 letters is not less than \(1.8088\). For \(k\ge 5\), the authors conjecture (basing on computer calculations) that the word \(x_k\) has critical exponent \(\frac{k-2}{k-3}\); for \(5\le k\le9\), they have established via their backtracking algorithm that no infinite balanced word over \(k\) letters has critical exponent less than \(\frac{k-2}{k-3}\).