A bijection proving the Aztec diamond theorem by combing lattice paths

zbMath1295.05027arXiv1209.5373MaRDI QIDQ396947

Frédéric Bosio, Marc A. A. van Leeuwen

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.5373

zbMATH Keywords

domino tilingbijective proofAztec diamondalgorithmic bijectionnon-intersecting paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (11)

Enumeration of antisymmetric monotone triangles and domino tilings of quartered Aztec rectangles ⋮ Generating function of the tilings of an Aztec rectangle with holes ⋮ A new simple proof of the Aztec diamond theorem ⋮ An extension of the Lindström-Gessel-Viennot theorem ⋮ A generalization of Aztec diamond theorem. I ⋮ Off-diagonally symmetric domino tilings of the Aztec diamond ⋮ A generalization of Aztec diamond theorem. II. ⋮ Multiply-refined enumeration of alternating sign matrices ⋮ Domino tilings of Aztec octagons ⋮ Domino tilings for augmented Aztec rectangles and their chains ⋮ Linear Recurrences for Cylindrical Networks

Cites Work

• Unnamed Item
• Alternating-sign matrices and domino tilings. I
• Remark on the dimer problem
• A simple proof of the Aztec diamond theorem
• Non-intersecting paths, random tilings and random matrices
• Perfect matchings of cellular graphs
• Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers
• Markov Chain Algorithms for Planar Lattice Structures

This page was built for publication: A bijection proving the Aztec diamond theorem by combing lattice paths