Languages invariant under more symmetries: overlapping factors versus palindromic richness

Details Languages invariant under more symmetries: overlapping factors versus palindromic richness Languages invariant under more symmetries: overlapping factors versus palindromic richness

2011-03-21

arxiv.org/abs/1103.4051v2

Mathematics

Combinatorics

22 pages, 1 figure

Scientific paper

Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 + \mathcal{C}(n+1)-\mathcal{C}(n)$ for any $n\in \mathbb{N}$\,. Word for which the equality is attained for any $n$ is usually called rich in palindromes. In this article we study words whose languages are invariant under a finite group $G$ of symmetries. For such words we prove a stronger version of the above inequality. We introduce notion of $G$-palindromic richness and give several examples of $G$-rich words, including the Thue-Morse sequence as well.

Affiliated with

Also associated with

No associations

Rating

Languages invariant under more symmetries: overlapping factors versus palindromic richness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Languages invariant under more symmetries: overlapping factors versus palindromic richness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Languages invariant under more symmetries: overlapping factors versus palindromic richness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323471