Palindromic Richness
arXiv:0801.1656 · doi:10.1016/j.ejc.2008.04.006
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 rich words (both strictly contain all rich words, but neither one is contained in the other). In particular, we classify all recurrent balanced weakly rich words. As a consequence, we show that any such word on at least three letters is necessarily episturmian; hence weakly rich words obey Fraenkel's conjecture. Likewise, we prove that a certain class of almost rich words obeys Fraenkel's conjecture by showing that the recurrent balanced ones are episturmian or contain at least two distinct letters with the same frequency. Lastly, we study the action of morphisms on (almost) rich words with particular interest in morphisms that preserve (almost) richness. Such morphisms belong to the class of "P-morphisms" that was introduced by A. Hof, O. Knill, and B. Simon in 1995.
26 pages; merged with work of Steve Widmer and Luca Q. Zamboni on weakly rich words; accepted by the European Journal of Combinatorics
References in corpus (1)
Cited by in corpus (53)
- Episturmian words: a survey
- A connection between palindromic and factor complexity using return words
- Enumeration and Structure of Trapezoidal Words
- A new characteristic property of rich words
- Rich, Sturmian, and trapezoidal words
- On the least number of palindromes contained in an infinite word
- Local symmetry dynamics in one-dimensional aperiodic lattices
- Introducing Privileged Words: Privileged Complexity of Sturmian Words
- On the Combinatorics of Palindromes and Antipalindromes
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- A Classification of Trapezoidal Words
- Extensions of rich words
- Abelian Combinatorics on Words: a Survey
- Infinite Words with Finite Defect
- On Theta-palindromic Richness
- Palindromic richness for languages invariant under more symmetries
- The Number of Distinct Subpalindromes in Random Words
- Proof of Brlek-Reutenauer conjecture
- On Number of Rich Words
- Palindromic closures using multiple antimorphisms
- Open and Closed Prefixes of Sturmian Words
- The sequence of open and closed prefixes of a Sturmian word
- On Brlek-Reutenauer conjecture
- Constructions of words rich in palindromes and pseudopalindromes
- Upper Bound for Palindromic and Factor Complexity of Rich Words
- The repetition threshold for binary rich words
- Privileged Factors in the Thue-Morse Word - A Comparison of Privileged Words and Palindromes
- Morphic images of episturmian words having finite palindromic defect
- Lambda Words: A Class of Rich Words Defined Over an Infinite Alphabet
- Infinite words rich and almost rich in generalized palindromes
- A Unique Extension of Rich Words
- Repetitions in infinite palindrome-rich words
- Factor frequencies in languages invariant under more symmetries
- Is Linear Recognizable Online
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs
- On Words with the Zero Palindromic Defect
- Palindromic factorization of rich words
- Generalized Thue-Morse words and palindromic richness
- Construction Of A Rich Word Containing Given Two Factors
- Efficient computation of longest single-arm-gapped palindromes in a string
- On the Zero Defect Conjecture
- Double-Ended Palindromic Trees in Linear Time
- On Generating Binary Words Palindromically
- Palindromes In Sturmian Strings
- On the Number of Closed Factors in a Word
- Palindromes in two-dimensional Words
- Stability properties for subgroups generated by return words
- Counting scattered palindromes in a finite word
- Balanced words in higher dimensions
- Sturmian Jungle (or Garden?) on Multiliteral Alphabets
- Palindromes in infinite ternary words
- Generalized trapezoidal words
- A metric characterisation of repulsive tilings