English

Distances on Rhombus Tilings

Discrete Mathematics 2011-12-07 v2 Data Structures and Algorithms Combinatorics

Abstract

The rhombus tilings of a simply connected domain of the Euclidean plane are known to form a flip-connected space (a flip is the elementary operation on rhombus tilings which rotates 180{\deg} a hexagon made of three rhombi). Motivated by the study of a quasicrystal growth model, we are here interested in better understanding how "tight" rhombus tiling spaces are flip-connected. We introduce a lower bound (Hamming-distance) on the minimal number of flips to link two tilings (flip-distance), and we investigate whether it is sharp. The answer depends on the number n of different edge directions in the tiling: positive for n=3 (dimer tilings) or n=4 (octogonal tilings), but possibly negative for n=5 (decagonal tilings) or greater values of n. A standard proof is provided for the n=3 and n=4 cases, while the complexity of the n=5 case led to a computer-assisted proof (whose main result can however be easily checked by hand).

Keywords

Cite

@article{arxiv.0911.2804,
  title  = {Distances on Rhombus Tilings},
  author = {Olivier Bodini and Thomas Fernique and Michael Rao and Eric Remila},
  journal= {arXiv preprint arXiv:0911.2804},
  year   = {2011}
}

Comments

18 pages, 9 figures, submitted to Theoretical Computer Science (special issue of DGCI'09)

R2 v1 2026-06-21T14:11:39.996Z