Computations versus bijections for tiling enumeration

DOI10.1016/j.aam.2022.102427zbMath1498.05018OpenAlexW4294795229MaRDI QIDQ2081913

Ilse Fischer

Publication date: 30 September 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2022.102427

zbMATH Keywords

number of domino tilings of an Aztec rectanglerestricted straight enumerationsigned enumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• Unnamed Item
• Unnamed Item
• Double Aztec rectangles
• Alternating-sign matrices and domino tilings. II
• The number of monotone triangles with prescribed bottom row
• Alternating sign matrices and descending plane partitions
• A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
• A Rogers-Ramanujan bijection
• Alternating-sign matrices and domino tilings. I
• Generalized domino-shuffling.
• Another involution principle-free bijective proof of Stanley's hook-content formula
• Perfect matchings of cellular graphs
• A bijective proof of the ASM theorem. I: The operator formula
• A method for proving polynomial enumeration formulas
• Method for constructing bijections for classical partition identities
• The mysterious story of square ice, piles of cubes, and bijections
• A Bijective Proof of the ASM Theorem Part II: ASM Enumeration and ASM–DPP Relation

This page was built for publication: Computations versus bijections for tiling enumeration