Critical factorisation in square-free words

From MaRDI portal
Publication:5066974

DOI10.1051/ITA/2022003zbMATH Open1493.68282arXiv2107.09421OpenAlexW4212984554MaRDI QIDQ5066974FDOQ5066974


Authors: Tero Harju Edit this on Wikidata


Publication date: 31 March 2022

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Abstract: A position p in a word w is critical if the minimal local period at p is equal to the global period of w. According to the Critical Factorisation Theorem all words of length at least two have a critical point. We study the number eta(w) of critical points of square-free ternary words w, i.e., words over a three letter alphabet. We show that the sufficiently long square-free words w satisfy eta(w)le|w|5 where |w| denotes the length of w. Moreover, the bound |w|5 is reached by infinitely many words. On the other hand, every square-free word w has at least |w|/4 critical points, and there is a sequence of these words closing to this bound.


Full work available at URL: https://arxiv.org/abs/2107.09421




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Critical factorisation in square-free words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066974)