Abstract
Aztec dragons are lattice regions first introduced by James Propp, which have the number of tilings given by a power of 2. This family of regions has been investigated further by a number of authors. In this paper, we consider a generalization of the Aztec dragons to two new families of 6-sided regions. By using Kuo’s graphical condensation method, we prove that the tilings of the new regions are always enumerated by powers of 2 and 3.
Original language | English (US) |
---|---|
Pages (from-to) | 1979-1999 |
Number of pages | 21 |
Journal | Graphs and Combinatorics |
Volume | 32 |
Issue number | 5 |
DOIs | |
State | Published - Sep 1 2016 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2016, Springer Japan.
Keywords
- Aztec dragons
- Graphical condensation
- Perfect matchings
- Tilings