On Generating Binary Words Palindromically

Abstract

International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivalence relation on {1,2, ... , n\} where i is equivalent to j if and only if u_i=u_j. Some finite words (in particular all binary words) are generated by palindromic relations of the form k ~ j+i-k for some choice of 1\leq i\leq j\leq n and k\in {i,i+1, ... ,j}. That is to say, some finite words u 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 \mu(u) defined as the least number of palindromic relations required to generate u. We show that if x is an infinite word such that \mu(u)\leq 2 for each factor u of x, then x is ultimately periodic. On the other hand, we establish the existence of non-ultimately periodic words for which \mu(u)\leq 3 for each factor u of x, and 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 \mu is unbounded