Open and closed factors of Arnoux-Rauzy words
Abstract
A finite word u is called closed if its longest repeated prefix has exactly two occurrences in u, once as a prefix and once as a suffix. We study the function fxc: N → N which counts the number of closed factors of each length in an infinite word x. We derive an explicit formula for fxc in case x is an Arnoux-Rauzy word. As a consequence we prove that n→ ∞fxc(n)=+∞.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.