A shuffling theorem for lozenge tilings of doubly-dented hexagons
From MaRDI portal
Publication:6319059
arXiv1905.08311MaRDI QIDQ6319059FDOQ6319059
Authors: Tri Lai, Ranjan Rohatgi 
Publication date: 20 May 2019
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 -series.
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45)
This page was built for publication: A shuffling theorem for lozenge tilings of doubly-dented hexagons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6319059)
