Domino tilings of Aztec diamonds and squares

DOI10.1007/s10958-009-9421-3zbMath1180.05027OpenAlexW2023305282MaRDI QIDQ1037001

K. P. Kokhas'

Publication date: 13 November 2009

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-009-9421-3

zbMATH Keywords

generating polynomialsnumber of domino tilingsrhombusAztek diamondrank of a tilingstatistics of tilingsweights of edges

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (4)

Chip removal for computing the number of perfect matchings ⋮ A new simple proof of the Aztec diamond theorem ⋮ On metric dimension of subdivided honeycomb network and Aztec diamond network ⋮ Dungeons and dragons: combinatorics for the \(dP_3\) quiver

Cites Work

• Applications of graphical condensation for enumerating matchings and tilings
• Perfect matchings and the octahedron recurrence
• Alternating-sign matrices and domino tilings. I
• Domino tilings with barriers
• Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
• Generalized domino-shuffling.
• Perfect matchings and perfect powers
• A simple proof of the Aztec diamond theorem
• The statistics of dimers on a lattice
• Counting domino tilings of rectangles via resultants
• Enumeration of perfect matchings in graphs with reflective symmetry

This page was built for publication: Domino tilings of Aztec diamonds and squares