Aperiodic Two-Dimensional Words of Small Abelian Complexity
In this paper we prove an abelian analog of the famous Nivat's conjecture linking complexity and periodicity for two-dimensional words: We show that if a two-dimensional recurrent word contains at most two abelian factors for each pair $(n,m)$ of integers, then it has a periodicity vector. Moreover, we show that a two-dimensional aperiodic recurrent word must have more than two abelian factors infinitely often. On the other hand, there exist aperiodic recurrent words with abelian complexity bounded by $3$, as well as aperiodic words having abelian complexity $1$ for some pairs $(m,n)$.
2021 ◽
Vol 77
(2)
◽
pp. 211-218
Keyword(s):
1980 ◽
Vol 102
(2)
◽
pp. 125-137
◽
Keyword(s):
1989 ◽
Vol 03
(03n04)
◽
pp. 295-319
◽
Keyword(s):
2018 ◽
Vol 52
(2-3-4)
◽
pp. 235-251
Keyword(s):
Keyword(s):
2021 ◽
Vol 57
(2)
◽
pp. 185-189
Keyword(s):