A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

Some further results on squarefree arithmetic progressions in infinite words




TekijätCurrie J., Harju T., Ochem P., Rampersad N.

KustantajaElsevier B.V.

Julkaisuvuosi2019

JournalTheoretical Computer Science

Tietokannassa oleva lehden nimiTheoretical Computer Science

Vuosikerta799

Aloitussivu140

Lopetussivu148

Sivujen määrä9

ISSN0304-3975

DOIhttps://doi.org/10.1016/j.tcs.2019.10.006


Tiivistelmä

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.



Last updated on 2024-26-11 at 20:31