Journal Articles Theoretical Computer Science Year : 2019

Some further results on squarefree arithmetic progressions in infinite words

Abstract

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, the subsequence of w indexed by the multiples of p contains a square.
Fichier principal
Vignette du fichier
1901.06351v1.pdf (499.22 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-02349876 , version 1 (05-11-2019)

Identifiers

Cite

James Currie, Tero Harju, Pascal Ochem, Narad Rampersad. Some further results on squarefree arithmetic progressions in infinite words. Theoretical Computer Science, 2019, 799, pp.140-148. ⟨10.1016/j.tcs.2019.10.006⟩. ⟨lirmm-02349876⟩
59 View
110 Download

Altmetric

Share

More