A Note on Domino Shuffling

  • É. Janvresse
  • T. de la Rue
  • Y. Velenik

Abstract

We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification is specially tailored to deal with cases when some of the weights are zero. This allows us to tile efficiently a large class of planar graphs, by embedding them in a large enough Aztec diamond. We also give a sufficient condition on the size of the latter diamond for the algorithm to succeed.

Published
2006-04-04
Article Number
R30