Factor versus palindromic complexity of uniformly recurrent infinite words
Abstract
We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate of the palindromic complexity in terms of the factor complexity then the one presented by Allouche et al. We provide several examples of infinite words for which our estimate reaches its upper bound. In particular, we derive an explicit prescription for the palindromic complexity of infinite words coding r-interval exchange transformations. If the permutation \pi connected with the transformation is given by \pi(k)=r+1-k for all k, then there is exactly one palindrome of every even length, and exactly r palindromes of every odd length.
Cite
@article{arxiv.math/0603607,
title = {Factor versus palindromic complexity of uniformly recurrent infinite words},
author = {Peter Baláži and Zuzana Masáková and Edita Pelantová},
journal= {arXiv preprint arXiv:math/0603607},
year = {2007}
}
Comments
16 pages, submitted to Theoretical Computer Science