What the study found
The authors verify a conjecture that the repetition threshold for the class of d-ary sequences rich in palindromes tends to 2 as the alphabet size d grows. A repetition threshold is the smallest number r such that a sequence from the class contains no repetition with exponent greater than r.
Why the authors say this matters
The study suggests that the behavior previously found for binary and ternary rich-palindrome sequences extends to larger alphabets. The authors present this as confirming the conjectured long-term trend for the repetition threshold in the class C_d.
What the researchers tested
The researchers studied the class C_d of d-ary sequences that are rich in palindromes, meaning sequences with a maximal number of palindromic factors. They compared their result with earlier work that determined the repetition threshold for C_2 and C_3.
What worked and what didn't
The conjecture was verified: the repetition threshold for C_d tends to 2 as d increases. The abstract does not describe any results that failed or any competing cases that were ruled out in detail.
What to keep in mind
The summary provided here is limited to the abstract, so technical details of the proof are not described. The abstract also does not state specific bounds, examples, or limitations beyond the asymptotic claim.
- The paper verifies a conjecture about repetition thresholds for rich-palindrome sequences.
- For the class C_d, the repetition threshold is said to tend to 2 as d grows.
- A repetition threshold is the smallest r that avoids repetitions with exponent greater than r.
- The study builds on earlier results for C_2 and C_3.

