Low-complexity tilings of the plane

DOI10.1007/978-3-030-23247-4_2zbMath1434.68264arXiv1905.04183OpenAlexW2966870481MaRDI QIDQ2179324

Jarkko Kari

Publication date: 12 May 2020

Full work available at URL: https://arxiv.org/abs/1905.04183

zbMATH Keywords

periodicitycommutative algebraNivat's conjecturedomino problemalgebraic subshiftslow-complexity configurationslow-complexity subshiftspattern complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Combinatorial aspects of tessellation and tiling problems (05B45) Symbolic dynamics (37B10) Formal power series rings (13F25) Tiling dynamics (37B52) Multidimensional shifts of finite type (37B51)

Related Items (4)

On perfect coverings of two-dimensional grids ⋮ Expansivity and periodicity in algebraic subshifts ⋮ On forced periodicity of perfect colorings ⋮ Domino problem for pretty low complexity subshifts

This page was built for publication: Low-complexity tilings of the plane