English

Open and closed factors of Arnoux-Rauzy words

Combinatorics 2019-02-28 v2

Abstract

A finite word uu is called closed if its longest repeated prefix has exactly two occurrences in u,u, once as a prefix and once as a suffix. We study the function fxc:NNf_x^c:\mathbb N \rightarrow \mathbb N which counts the number of closed factors of each length in an infinite word x.x. We derive an explicit formula for fxcf_x^c in case xx is an Arnoux-Rauzy word. As a consequence we prove that lim infnfxc(n)=+.\liminf _{n\rightarrow \infty}f_x^c(n)=+\infty.

Keywords

Cite

@article{arxiv.1810.05472,
  title  = {Open and closed factors of Arnoux-Rauzy words},
  author = {Olga Parshina and Luca Zamboni},
  journal= {arXiv preprint arXiv:1810.05472},
  year   = {2019}
}