Grid graphs, Gorenstein polytopes, and domino stackings
Combinatorics
2009-12-15 v2
Abstract
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in particular, when these polytopes are Gorenstein. We also introduce the notion of domino stackings and present some results and several open questions. Our techniques use results from graph theory, polyhedral geometry, and enumerative combinatorics.
Cite
@article{arxiv.0711.4151,
title = {Grid graphs, Gorenstein polytopes, and domino stackings},
author = {Matthias Beck and Christian Haase and Steven V. Sam},
journal= {arXiv preprint arXiv:0711.4151},
year = {2009}
}
Comments
14 pages, 6 figures, uses graphs package