A topological study of tilings

Authors:
Grégory Lafitte;Michael Weiss
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille, CNRS, Aix-Marseille Université, Marseille Cedex 13, France;Centre Universitaire d'Informatique, Université de Genève, Carouge, Switzerland
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 6
Cited 2

Tilings and quasiperiodicity

Theoretical Computer Science
Complex tilings

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
De la logique aux pavages

Theoretical Computer Science
On Aperiodic Sets of Wang Tiles

Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Tilings: recursivity and regularity

Theoretical Computer Science
Universal tilings

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

An Almost Totally Universal Tile Set

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Tilings: Simulation and universality

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

To tile consists in assembling colored tiles on Z2 while respecting color matching. Tilings, the outcome of the tile process, can be seen as a computationmodel. In order to better understand the global structure of tilings, we introduce two topologies on tilings, one à la Cantor and another one à la Besicovitch. Our topologies are concerned with the whole set of tilings that can be generated by any tile set and are thus independent of a particular tile set. We study the properties of these two spaces and compare them. Finally, we introduce two infinite games on these spaces that are promising tools for the study of the structure of tilings.