Palindromic Richness
Amy Glen, Jacques Justin, Steve Widmer, Luca Q. Zamboni

TL;DR
This paper investigates the combinatorial and structural properties of rich words, a class of words with maximal palindromic content, providing classifications, characterizations, and insights into their behavior under morphisms.
Contribution
It offers a unified framework for understanding rich words, characterizes periodic and balanced cases, and explores their relation to Fraenkel's conjecture and morphism actions.
Findings
Recurrent balanced rich infinite words are episturmian.
Weakly rich words on three or more letters obey Fraenkel's conjecture.
Certain almost rich words are either episturmian or have repeated letter frequencies.
Abstract
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of so-called "rich words" is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author together with X. Droubay and G. Pirillo in 2001. Other examples of rich words have appeared in many different contexts. Here we present the first unified approach to the study of this intriguing family of words. Amongst our main results, we give an explicit description of the periodic rich infinite words and show that the recurrent balanced rich infinite words coincide with the balanced episturmian words. We also consider two wider classes of infinite words, namely "weakly rich words" and almost…
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.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Advanced Combinatorial Mathematics
