The Weak Circular Repetition Threshold Over Large Alphabets

DOI10.1051/ITA/2020006MaRDI QIDQ6331767arXivFDO

Authors L. A. S. Mól, Narad Rampersad

Publication date 22 December 2019

Published in arXiv

Full work available at URL https://doi.org/10.1051/ITA/2020006

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorics on words (68R15)

arXiv classification

cs.DMcs.FLmath.CO

Abstract: The repetition threshold for words on $n$ letters, denoted $mboxRT(n)$, is the infimum of the set of all $r$ such that there are arbitrarily long $r$-free words over $n$ letters. A repetition threshold for circular words on $n$ letters can be defined in three natural ways, which gives rise to the weak, intermediate, and strong circular repetition thresholds for $n$ letters, denoted $mbox{CRT}_{mboxW}(n)$, $mbox{CRT}_{mboxI}(n)$, and $mbox{CRT}_{mboxS}(n)$, respectively. Currie and the present authors conjectured that $mbox{CRT}_{mboxI}(n)=mbox{CRT}_{mboxW}(n)=mboxRT(n)$ for all $ngeq4$. We prove that $mbox{CRT}_{mboxW}(n)=mboxRT(n)$ for all $ngeq45$, which confirms a weak version of this conjecture for all but finitely many values of $n$.

This page was built for publication: The Weak Circular Repetition Threshold Over Large Alphabets

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