A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Nivat's conjecture and pattern complexity in algebraic subshifts
Tekijät: Kari Jarkko, Moutot Etienne
Kustantaja: Elsevier B.V.
Julkaisuvuosi: 2019
Lehti:Theoretical Computer Science
Tietokannassa oleva lehden nimiTheoretical Computer Science
Vuosikerta: 777
Aloitussivu: 379
Lopetussivu: 386
Sivujen määrä: 8
ISSN: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2018.12.029
Rinnakkaistallenteen osoite: https://arxiv.org/pdf/1806.07107.pdf
We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional algebraic subshifts over defined by a polynomial without line polynomial factors in more than one direction. We also find an algebraic subshift that is defined by a product of two line polynomials that has this property (the 4-dot system) and another one that does not.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
