Article thumbnail

Structural aspects of tilings

By Alexis Ballier, Bruno Durand and Emmanuel Jeandal

Abstract

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in two different contexts: the first one is combinatorial and the other topological. These two approaches have independent merits and, once combined, provide somehow surprising results. The particular case where the set of produced tilings is countable is deeply investigated while we prove that the uncountable case may have a completely different structure. We introduce a pattern preorder and also make use of Cantor-Bendixson rank. Our first main result is that a tile-set that produces only periodic tilings produces only a finite number of them. Our second main result exhibits a tiling with exactly one vector of periodicity in the countable case

Topics: Tiling, domino, patterns, tiling preorder, tiling structure, Data processing Computer science, General Literature
Publisher: LIPIcs - Leibniz International Proceedings in Informatics. 25th International Symposium on Theoretical Aspects of Computer Science
Year: 2008
DOI identifier: 10.4230/LIPIcs.STACS.2008.1334
OAI identifier: oai:drops-oai.dagstuhl.de:1334

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles