A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane

Olivier Bodini 1 Thomas Fernique 2 Éric Rémila 3
2 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : It is known that any two rhombus tilings of a polygon are flip-accessible, that is, linked by a finite sequence of local transformations called flips. This paper considers flip-accessibility for rhombus tilings of the whole plane, asking whether any two of them are linked by a possibly infinite sequence of flips. The answer turning out to depend on tilings, a characterization of flip-accessibility is provided. This yields, for example, that any tiling by Penrose tiles is flip-accessible from a Penrose tiling.
Type de document :
Article dans une revue
Information and Computation, Elsevier, 2008, Special Issue: 1st International Conference on Language and Automata Theory and Applications (LATA 2007), 206 (9-10), pp.1065-1073. 〈10.1016/j.ic.2008.03.008〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00379207
Contributeur : Thomas Fernique <>
Soumis le : mardi 28 avril 2009 - 08:45:43
Dernière modification le : mardi 16 janvier 2018 - 15:35:25

Identifiants

Citation

Olivier Bodini, Thomas Fernique, Éric Rémila. A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane. Information and Computation, Elsevier, 2008, Special Issue: 1st International Conference on Language and Automata Theory and Applications (LATA 2007), 206 (9-10), pp.1065-1073. 〈10.1016/j.ic.2008.03.008〉. 〈lirmm-00379207〉

Partager

Métriques

Consultations de la notice

110