Palindromic prefixes and episturmian words

  • Authors:

  • Stéphane Fischler

  • Affiliations:

  • Équipe d'Arithmétique et de Géométrie Algébrique, Bâtiment, Université Paris-Sud, Orsay Cedex, France

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

Let w be an infinite word on an alphabet A. We denote by (ni)i ≥ 1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1 ≤ 2ni + 1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an application, we study the values taken by the quantity lim supni+1/ni, and prove that it is minimal (among all nonperiodic words) for the Fibonacci word.