<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05947177</id>
  <dt>j</dt>
  <an>05947177</an>
  <augroup>
    <au>Bodini, Olivier</au>
    <au>Fernique, Thomas</au>
    <au>Rao, Michael</au>
    <au>R\'emila, \'Eric</au>
  </augroup>
  <ti>Distances on rhombus tilings.</ti>
  <so>Theor. Comput. Sci. 412, No. 36, 4787-4794 (2011).</so>
  <py>2011</py>
  <pu>Elsevier Science Publishers, Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>computer-assisted proof</ut>
    <ut>flip</ut>
    <ut>phason</ut>
    <ut>pseudoline arrangement</ut>
    <ut>quasicrystal</ut>
    <ut>rhombus tiling</ut>
    <ut>tiling space</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.tcs.2011.04.015</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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^{\circ}$ 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$ (octagonal 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 manually).</ab>
    <rv></rv>
  </abgroup>
</item>