Computations versus bijections for tiling enumeration
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1375575 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A Rogers-Ramanujan bijection
- A bijective proof of the ASM theorem. I: The operator formula
- A bijective proof of the ASM theorem. II: ASM enumeration and ASM-DPP relation
- A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
- A method for proving polynomial enumeration formulas
- Alternating sign matrices and descending plane partitions
- Alternating-sign matrices and domino tilings. I
- Alternating-sign matrices and domino tilings. II
- Another involution principle-free bijective proof of Stanley's hook-content formula
- Double Aztec rectangles
- Generalized domino-shuffling.
- Method for constructing bijections for classical partition identities
- Perfect matchings of cellular graphs
- The mysterious story of square ice, piles of cubes, and bijections
- The number of monotone triangles with prescribed bottom row
Cited in
(2)
This page was built for publication: Computations versus bijections for tiling enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081913)