Open and closed factors of Arnoux-Rauzy words
arXiv:1810.05472
Abstract
A finite word is called closed if its longest repeated prefix has exactly two occurrences in once as a prefix and once as a suffix. We study the function which counts the number of closed factors of each length in an infinite word We derive an explicit formula for in case is an Arnoux-Rauzy word. As a consequence we prove that