Avoiding Square-Free Words on Free Groups

DOI10.1016/J.TCS.2022.04.025MaRDI QIDQ6365295arXivFDO

Authors Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld

Publication date 14 April 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.TCS.2022.04.025

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Combinatorics on words (68R15)

arXiv classification

math.CO

Abstract: We consider sets of factors that can be avoided in square-free words on two-generator free groups. The elements of the group are presented in terms of 0,1,2,3 such that 0 and 2 (resp.,1 and 3) are inverses of each other so that 02, 20, 13 and 31 do not occur in a reduced word. A Dean word is a reduced word that does not contain occurrences of $uu$ for any nonempty $u$. Dean showed in 1965 that there exist infinite square-free reduced words. We show that if $w$ is a Dean word of length at least 59 then there are at most six reduced words of length 3 avoided by $w$. We construct an infinite Dean word avoiding six reduced words of length~3. We also construct infinite Dean words with low critical exponent and avoiding fewer reduced words of length 3. Finally, we show that the minimal frequency of a letter in a Dean word is $8/59$ and the growth rate is close to 1.45818.

This page was built for publication: Avoiding Square-Free Words on Free Groups

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