On Theta-palindromic Richness
classification
🧮 math.CO
keywords
thetarichnessunderwordscomplexityinvariantnotionpalindrome
read the original abstract
In this paper we study generalization of the reversal mapping realized by an arbitrary involutory antimorphism $\Theta$. It generalizes the notion of a palindrome into a $\Theta$-palindrome -- a word invariant under $\Theta$. For languages closed under $\Theta$ we give the relation between $\Theta$-palindromic complexity and factor complexity. We generalize the notion of richness to $\Theta$-richness and we prove analogous characterizations of words that are $\Theta$-rich, especially in the case of set of factors invariant under $\Theta$. A criterion for $\Theta$-richness of $\Theta$-episturmian words is given together with other examples of $\Theta$-rich words.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.