Abstract
We solve and generalize an open problem posted by James Propp (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999) on the number of tilings of quasi-hexagonal regions on the square lattice with every third diagonal drawn in. We also obtain a generalization of Douglas' theorem on the number of tilings of a family of regions of the square lattice with every second diagonal drawn in.
Original language | English (US) |
---|---|
Pages (from-to) | 53-81 |
Number of pages | 29 |
Journal | Journal of Combinatorial Theory. Series A |
Volume | 122 |
Issue number | 1 |
DOIs | |
State | Published - Feb 2014 |
Externally published | Yes |
Keywords
- Aztec diamonds
- Aztec rectangles
- Dual graphs
- Perfect matchings
- Quasi-hexagons
- Tilings