Structural aspects of tilings
| dc.creator | Ballier, Alexis | |
| dc.creator | Durand, Bruno | |
| dc.creator | Jeandel, Emmanuel | |
| dc.date | 2008-02-20 | |
| dc.date.accessioned | 2026-07-07T09:21:59Z | |
| dc.date.available | 2026-07-07T09:21:59Z | |
| dc.description | 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. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/0802.2828 | |
| dc.identifier | http://arxiv.org/abs/0802.2828 | |
| dc.identifier | Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155221 | |
| dc.subject | Other Computer Science | |
| dc.title | Structural aspects of tilings | |
| dc.type | text |