Grid Graphs, Gorenstein Polytopes, and Domino Stackings
Name
Sam_Grid Graphs.pdf
Size
230.26 KB
Format
Adobe PDF
Checksum (MD5)
34da03b437615a380fe303b1037c4e6c
Author(s)
Beck, Matthias
Haase, Christian
Sam, Steven V.
Date Issued
February 2009
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00373-005-0858-y
