A Shuffling Theorem for Reflectively Symmetric Tilings
arXiv:1905.09268
Abstract
In arXiv:1905.08311, the author and Rohatgi proved a shuffling theorem for doubly-dented hexagons. In particular, we showed that shuffling removed unit triangles along a horizontal axis in a hexagon only changes the tiling number by a simple multiplicative factor. In this paper, we consider a similar phenomenon for a symmetry class of tilings, the reflectively symmetric tilings, of the doubly-dented hexagons. We also prove several shuffling theorems for halved hexagons. These theorems generalize a number of known results in the enumeration of halved hexagons.
arXiv commentSecond version: 21 pages
References in corpus (7)
- The shape of a typical boxed plane partition
- A dual of MacMahon's theorem on plane partitions
- Bijective proofs of skew Schur polynomial factorizations
- Tiling enumeration of doubly-intruded halved hexagons
- Lozenge tilings of hexagons with central holes and dents
- Lozenge tilings of doubly-intruded hexagons
- Tiling Enumeration of Hexagons with Off-central Holes