A Shuffling Theorem for Reflectively Symmetric Tilings
classification
🧮 math.CO
keywords
hexagonsshufflingtilingsdoubly-dentedhalvednumberreflectivelysymmetric
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.