A q-enumeration of lozenge tilings of a hexagon with three dents

详细信息    查看全文

• 作者：Tri Lai ^{tlai@umn.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：05A15 ; 05C30 ; 05C70
• 刊名：Advances in Applied Mathematics
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：82
• 期：Complete
• 页码：23-57
• 全文大小：952 K

文摘

MacMahon's classical theorem on boxed plane partitions states that the generating function of the plane partitions fitting in an a×b×c$a\times b\times c$ box is equal to where H_q(n):=[0]_q!⋅[1]_q!…[n−1]_q!${\mathrm{H}}_q(n):={[0]}_q!\cdot {[1]}_q!\dots {[n-1]}_q!$ and ${[n]}_q!:={\prod }_{i=1}^n(1+q+q^2+\dots +q^{i-1})$. By viewing a boxed plane partition as a lozenge tiling of a semi-regular hexagon, MacMahon's theorem yields a natural q-enumeration of lozenge tilings of the hexagon. However, such q-enumerations do not appear often in the domain of enumeration of lozenge tilings. In this paper, we consider a new q-enumeration of lozenge tilings of a hexagon with three bowtie-shaped regions 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  , e24e41ee03bc80f7bf53ba74222971c7" title="Click to view the MathML source">2n+3$2n+3$, 2n  , e24e41ee03bc80f7bf53ba74222971c7" title="Click to view the MathML source">2n+3$2n+3$, 2n  , e24e41ee03bc80f7bf53ba74222971c7" title="Click to view the MathML source">2n+3$2n+3$ (in cyclic order) with the central unit triangles on the (2n+3)$(2n+3)$-sides removed. Moreover, our result also implies a q-enumeration of boxed plane partitions with certain constraints.