Abstract: We generalize Aztec diamond theorem (N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, Alternating-sign matrices and domino tilings, Journal Algebraic Combinatoric, 1992) by showing that the numbers of tilings of a certain family of regions in the square lattice with southwest-to-northeast diagonals drawn in are given by powers of 2. We present a proof for the generalization by using a bijection between domino tilings and non-intersecting lattice paths.
Recommendations
Cites work
- A Course in Enumeration
- A bijection proving the Aztec diamond theorem by combing lattice paths
- A simple proof of the Aztec diamond theorem
- Alternating-sign matrices and domino tilings. I
- Applications of graphical condensation for enumerating matchings and tilings
- Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers
- Binomial determinants, paths, and hook length formulae
- Generalized domino-shuffling.
- Laurent biorthogonal polynomials, \( q\)-Narayana polynomials and domino tilings of the Aztec diamonds
- Nonintersecting paths, pfaffians, and plane partitions
- On the Vector Representations of Induced Matroids
Cited in
(11)- A bijection proving the Aztec diamond theorem by combing lattice paths
- Enumeration of hybrid domino-lozenge tilings. III: centrally symmetric tilings
- New aspects of regions whose tilings are enumerated by perfect powers
- Enumeration of hybrid domino-lozenge tilings. II: Quasi-octagonal regions
- Generating function of the tilings of an Aztec rectangle with holes
- Proof of a conjecture of Kenyon and Wilson on semicontiguous minors
- Walks on tilings of polygons
- Double Aztec rectangles
- A new simple proof of the Aztec diamond theorem
- A generalization of Aztec diamond theorem. II.
- A generalization of Aztec dragons
This page was built for publication: A generalization of Aztec diamond theorem. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405149)
