Some further results on squarefree arithmetic progressions in infinite words
: Currie J., Harju T., Ochem P., Rampersad N.
Publisher: Elsevier B.V.
: 2019
: Theoretical Computer Science
: Theoretical Computer Science
: 799
: 140
: 148
: 9
: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2019.10.006
In a recent paper, one of us posed three open problems concerning
squarefree arithmetic progressions in infinite words. In this paper we
solve these problems and prove some additional results. For instance,
among other things, we show that there exists a squarefree word w over a ternary alphabet such that for every p≥3" role="presentation">, the subsequence of w indexed by the multiples of p contains a square.