On k-Abelian Palindromic Rich and Poor Words
A word is called a palindrome if it is equal to its reversal. In the paper we consider a k-abelian modification of this notion. Two words are called k-abelian equivalent if they contain the same number of occurrences of each factor of length at most k. We say that a word is a k-abelian palindrome if it is k-abelian equivalent to its reversal. A question we deal with is the following: how many distinct palindromes can a word contain? It is well known that a word of length n can contain at most n + 1 distinct palindromes as its factors; such words are called rich. On the other hand, there exist infinite words containing only finitely many distinct palindromes as their factors; such words are called poor. It is easy to see that there are no abelian poor words, and there exist words containing Θ(n 2) distinct abelian palindromes. We analyze these notions with respect to k-abelian equivalence. We show that in the k-abelian case there exist poor words containing finitely many distinct k-abelian palindromic factors, and there exist rich words containing Θ(n 2) distinct k-abelian palindromes as their factors. Therefore, for poor words the situation resembles normal words, while for rich words it is similar to the abelian case.
KeywordsUnequal Number Normal Word Consecutive Element Binary Word Close Integer
Unable to display preview. Download preview PDF.
- 5.Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Infinite words without palindrome, Arxiv: 0903.2382 (2009)Google Scholar
- 13.Harju, T., Kärki, T., Nowotka, D.: The number of positions starting a square in binary words. Electron. J. Combin. 18(1) (2011)Google Scholar
- 18.Kolpakov, R., Kucherov, G.: Finding Maximal Repetitions in a Word in Linear Time. In: FOCS 1999, pp. 596–604 (1999)Google Scholar
- 19.Kucherov, G., Ochem, P., Rao, M.: How Many Square Occurrences Must a Binary Sequence Contain? Electr. J. Comb. 10 (2003)Google Scholar