561 research outputs found
On the least number of palindromes contained in an infinite word
We investigate the least number of palindromic factors in an infinite word.
We first consider general alphabets, and give answers to this problem for
periodic and non-periodic words, closed or not under reversal of factors. We
then investigate the same problem when the alphabet has size two.Comment: Accepted for publication in Theoretical Computer Scienc
On Theta-palindromic Richness
In this paper we study generalization of the reversal mapping realized by an
arbitrary involutory antimorphism . It generalizes the notion of a
palindrome into a -palindrome -- a word invariant under . For
languages closed under we give the relation between
-palindromic complexity and factor complexity. We generalize the notion
of richness to -richness and we prove analogous characterizations of
words that are -rich, especially in the case of set of factors
invariant under . A criterion for -richness of
-episturmian words is given together with other examples of
-rich words.Comment: 14 page
Proof of Brlek-Reutenauer conjecture
Brlek and Reutenauer conjectured that any infinite word u with language
closed under reversal satisfies the equality 2D(u) = \sum_{n=0}^{\infty}T_u(n)
in which D(u) denotes the defect of u and T_u(n) denotes C_u(n+1)-C_u(n) +2 -
P_U(n+1) - P_u(n), where C_u and P_u are the factor and palindromic complexity
of u, respectively. This conjecture was verified for periodic words by Brlek
and Reutenauer themselves. Using their results for periodic words, we have
recently proved the conjecture for uniformly recurrent words. In the present
article we prove the conjecture in its general version by a new method without
exploiting the result for periodic words.Comment: 9 page
Languages invariant under more symmetries: overlapping factors versus palindromic richness
Factor complexity and palindromic complexity of
infinite words with language closed under reversal are known to be related by
the inequality for any \,. Word for which
the equality is attained for any is usually called rich in palindromes. In
this article we study words whose languages are invariant under a finite group
of symmetries. For such words we prove a stronger version of the above
inequality. We introduce notion of -palindromic richness and give several
examples of -rich words, including the Thue-Morse sequence as well.Comment: 22 pages, 1 figur
On Generating Binary Words Palindromically
We regard a finite word up to word isomorphism as an
equivalence relation on where is equivalent to if
and only if Some finite words (in particular all binary words) are
generated by "{\it palindromic}" relations of the form for some
choice of and That is to say,
some finite words are uniquely determined up to word isomorphism by the
position and length of some of its palindromic factors. In this paper we study
the function defined as the least number of palindromic relations
required to generate We show that every aperiodic infinite word must
contain a factor with and that some infinite words have
the property that for each factor of We obtain a
complete classification of such words on a binary alphabet (which includes the
well known class of Sturmian words). In contrast for the Thue-Morse word, we
show that the function is unbounded
- …