Grid Graphs, Gorenstein Polytopes, and Domino Stackings

Author(s)
Beck, Matthias; Haase, Christian; Sam, Steven V.
Thumbnail
DownloadSam_Grid Graphs.pdf (230.2Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
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.
Date issued
2009-02
URI
http://hdl.handle.net/1721.1/66090
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Graphs and Combinatorics
Publisher
Springer Science + Business Media B.V.
Citation
Beck, Matthias, Christian Haase, and Steven V Sam. “Grid Graphs, Gorenstein Polytopes, and Domino Stackings.” Graphs and Combinatorics 25 (2009): 409-426.
Version: Author's final manuscript
ISSN
1435-5914
0911-0119
Collections