DeepAI AI Chat
Log In Sign Up

On morphisms preserving palindromic richness

by   Francesco Dolce, et al.

Droubay, Justin and Pirillo that each word of length n contains at most n+1 distinct palindromes. A finite "rich word" is a word with maximal number of palindromic factors. The definition of palindromic richness can be naturally extended to infinite words. Sturmian words and Rote complementary symmetric sequences form two classes of binary rich words, while episturmian words and words coding d-interval exchange transformations give us other examples on larger alphabets. In this paper we look for homomorphisms of the free monoid, which allow to construct new rich words from already known rich words. In particular we study two types of morphisms: Arnoux-Rauzy morphisms and morphisms from Class P_ret. These morphisms contain Sturmian morphisms as a subclass. We show that Arnoux-Rauzy morphisms preserve the set of all rich words. We also characterize P_ret morphisms which preserve richness on binary alphabet.


page 1

page 2

page 3

page 4


Finite and infinite closed-rich words

A word is called closed if it has a prefix which is also its suffix and ...

A Unique Extension of Rich Words

A word w is called rich if it contains | w|+1 palindromic factors, inclu...

Antisquares and Critical Exponents

The complement x̅ of a binary word x is obtained by changing each 0 in x...

Some properties of morphic images of (eventually) dendric words

The class of (eventually) dendric words generalizes well-known families ...

Dyck Words, Pattern Avoidance, and Automatic Sequences

We study various aspects of Dyck words appearing in binary sequences, wh...

Logarithmic equal-letter runs for BWT of purely morphic words

In this paper we study the number r_bwt of equal-letter runs produced by...

On k-Maximal Submonoids, with Applications in Combinatorics on Words

We define the notion of a k-maximal submonoid. A submonoid M is k-maxima...