Critical exponent of ternary words with few distinct palindromes
\v{L}ubom\'ira Dvo\v{r}\'akov\'a, Lucas Mol, and Pascal Ochem

TL;DR
This paper classifies infinite ternary words with few distinct palindromes based on their critical exponent, providing insights into their structural properties.
Contribution
It offers a classification of ternary words with limited palindromes according to their critical exponent, a novel approach in combinatorics on words.
Findings
Identifies the critical exponent for classes of ternary words with few palindromes.
Provides a taxonomy linking palindrome complexity and critical exponent.
Advances understanding of the structure of words with constrained palindrome diversity.
Abstract
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
