A bijection proving the Aztec diamond theorem by combing lattice paths
From MaRDI portal
Publication:396947
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
05A15: Exact enumeration problems, generating functions
05A19: Combinatorial identities, bijective combinatorics
Related Items
A generalization of Aztec diamond theorem. I, Multiply-refined enumeration of alternating sign matrices
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