Skip to Main content Skip to Navigation

On the structure of some spaces of tilings.

Abstract : We study the structure of the set of tilings of a polygon $P$ with bars of fixed length. We obtain a undirected graph connecting two tilings if one can pass from one tile to the other one by a flip (i. e a local replacement of tiles). Using algebraic tools (as tiling groups and their quotients and subgroups), we give a formula to compute the distance in this graph (i. e. the minimal number of necessary flips) between two tilings. Moreover, we prove that, for each pair (T, T') of tilings, the set \}Upsilon_{T, T' }formed from tilings which are in a path of minimal length from T to T' canonically has a structure of distributive lattice.
Keywords : Tiling Lattice Group
Document type :
Complete list of metadata
Contributor : Colette Orange Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:10:28 AM
Last modification on : Saturday, September 11, 2021 - 3:18:55 AM


Files produced by the author(s)


  • HAL Id : hal-02101946, version 1



Eric Rémila. On the structure of some spaces of tilings.. [Research Report] LIP RR-2000-15, Laboratoire de l'informatique du parallélisme. 2000, 2+23p. ⟨hal-02101946⟩



Les métriques sont temporairement indisponibles