Nivat's conjecture and pattern complexity in algebraic subshifts - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2019

Nivat's conjecture and pattern complexity in algebraic subshifts

Abstract

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 Fp 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.
Fichier principal
Vignette du fichier
karimoutot19.1.pdf (439.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02130713 , version 1 (16-05-2019)

Identifiers

Cite

Jarkko Kari, Etienne Moutot. Nivat's conjecture and pattern complexity in algebraic subshifts. Theoretical Computer Science, 2019, ⟨10.1016/j.tcs.2018.12.029⟩. ⟨hal-02130713⟩
37 View
121 Download

Altmetric

Share

Gmail Facebook X LinkedIn More