Low-Complexity Tilings of the Plane - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Low-Complexity Tilings of the Plane

Abstract

A two-dimensional configuration is a coloring of the infinite grid $$\mathbb {Z}^2$$ with finitely many colors. For a finite subset D of $$\mathbb {Z}^2$$, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The number of distinct D-patterns of a configuration is a natural measure of its complexity. A configuration is considered having low complexity with respect to shape D if the number of distinct D-patterns is at most |D|, the size of the shape. This extended abstract is a short review of an algebraic method to study periodicity of such low complexity configurations.
Fichier principal
Vignette du fichier
480958_1_En_2_Chapter.pdf (301.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387291 , version 1 (29-11-2019)

Licence

Attribution

Identifiers

Cite

Jarkko Kari. Low-Complexity Tilings of the Plane. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.35-45, ⟨10.1007/978-3-030-23247-4_2⟩. ⟨hal-02387291⟩
22 View
14 Download

Altmetric

Share

Gmail Facebook X LinkedIn More