Quasi-tilings

Dominique Rossin (1) , Daniel Krob (1) , Sebastien Desreux (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

The aim of this paper is to unify the definition of tilings on rectangular and triangular lattices. We first define pavages which are a simple extension of tilings. These pavages are considered as words on ${0,1}^n$. Then, usual problems on tilings are mapped into problems on permutation on these words. The lattice structure of tilings and so the connectivity of the tiling space under the flip operation is proved by this way.

Domaines: Combinatoire [math.CO]

Dominique Rossin, Daniel Krob, Sebastien Desreux. Quasi-tilings. FPSAC/SFCA'03, 2003, Linkoping, Sweden. ⟨hal-00016376⟩