Repetitions in infinite palindrome-rich words (Q2333034)

The authors consider a morphic binary infinite word, prove that it is rich in palindromes and find its critical exponent. They also conjecture that this critical exponent is minimal among all binary rich words. The proofs are obtained with the use of the Walnut software, recently updated by the first author to work not only with usual \(k\)-ary representations but also with the Pell representation and some other numeration systems. For the entire collection see [Zbl 1419.68014].