A shuffling theorem for lozenge tilings of doubly-dented hexagons

2019/05/20 by Lai, Tri, Rohatgi, Ranjan
#05A15 #05B45 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1905.08311

Abstract

MacMahon's theorem on plane partitions yields a simple product formula for tiling number of a hexagon, and Cohn, Larsen and Propp's theorem provides an explicit enumeration for tilings of a dented semihexagon via semi-strict Gelfand--Tsetlin patterns. In this paper, we prove a natural hybrid of the two theorems for hexagons with an arbitrary set of unit triangles removed along a horizontal axis. In particular, we show that the `shuffling' of removed unit triangles only changes the tiling number of the region by a simple multiplicative factor. Our main result generalizes a number of known enumerations and asymptotic enumerations of tilings. We also reveal connections of the main result to the study of symmetric functions and q-series.

Related

• A Shuffling Theorem for Reflectively Symmetric Tilings
• A Shuffling Theorem for Centrally Symmetric Tilings
• A simple explanation for the "shuffling phenomenon'' for lozenge tilings\n of dented hexagons
• A short proof of two shuffling theorems for tilings and a weighted generalization
• A q-enumeration of lozenge tilings of a hexagon with four adjacent triangles removed from the boundary