Distances in domino flip graphs
From MaRDI portal
Publication:4575419
Abstract: This article is about measuring and visualizing distances between domino tilings. Given two tilings of a simply connected square tiled surface, we're interested in the minimum number of flips between two tilings. Given a certain shape, we're interested in computing the diameters of the flip graphs, meaning the maximal distance between any two of its tilings. Building on work of Thurston and others, we give geometric interpretations of distances which result in formulas for the diameters of the flip graphs of rectangles or Aztec diamonds.
Recommendations
Cites work
- Alternating-sign matrices and domino tilings. I
- Conway's Tiling Groups
- Dimer problem in statistical mechanics-an exact result
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Spaces of domino tilings
- The diameter of associahedra
- The lattice structure of the set of domino tilings of a polygon
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(4)
This page was built for publication: Distances in domino flip graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575419)