| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426262 | Information and Computation | 2008 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
