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. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.tcs.2019.10.006 | Theoretical Computer Science |
Keywords | Field | DocType |
Squarefree word,Squarefree morphism,Automatic sequence,Thue word,Arithmetic progression | Discrete mathematics,Square-free integer,Arithmetic,Mathematics | Journal |
Volume | ISSN | Citations |
799 | 0304-3975 | 1 |
PageRank | References | Authors |
0.41 | 5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
James D. Currie | 1 | 240 | 42.86 |
Tero Harju | 2 | 714 | 106.10 |
Pascal Ochem | 3 | 258 | 36.91 |
narad rampersad | 4 | 230 | 41.26 |