2000 character limit reached
A $q$-enumeration of lozenge tilings of a hexagon with three dents
Published 20 Feb 2015 in math.CO | (1502.05780v5)
Abstract: We $q$-enumerate lozenge tilings of a hexagon with three bowtie-shaped regions have been removed from three non-consecutive sides. The unweighted version of the result generalizes a problem posed by James Propp on enumeration of lozenge tilings of a hexagon of side-lengths $2n,2n+3,2n,2n+3,2n,2n+3$ (in cyclic order) with the central unit triangles on the $(2n+3)$-sides removed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.