A short proof of two shuffling theorems for tilings and a weighted generalization
From MaRDI portal
Publication:2065887
DOI10.1016/j.disc.2021.112710zbMath1480.05004arXiv1906.04533OpenAlexW3211345405WikidataQ113877040 ScholiaQ113877040MaRDI QIDQ2065887
Publication date: 13 January 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.04533
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Applications of graphical condensation for enumerating matchings and tilings
- The other dual of MacMahon's theorem on plane partitions
- The shape of a typical boxed plane partition
- A shuffling theorem for reflectively symmetric tilings
- A simple explanation for the ``shuffling phenomenon for lozenge tilings of dented hexagons
- Bijective proofs of skew Schur polynomial factorizations