A curious family of binomial determinants that count rhombus tilings of a holey hexagon

From MaRDI portal
Publication:2000656

DOI10.1016/J.JCTA.2019.03.001zbMATH Open1416.05039arXiv1709.02616OpenAlexW2750593470WikidataQ128095779 ScholiaQ128095779MaRDI QIDQ2000656FDOQ2000656

Christoph Koutschan, Thotsaporn Thanatipanonda

Publication date: 28 June 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Dodgson identity with automated proof techniques. More precisely, we follow the holonomic ansatz that was proposed by Doron Zeilberger in 2007. We derive a compact and nice formula for Andrews's determinant, and use it to solve a challenge problem that we posed in a previous paper. By noting that Andrews's determinant is a special case of a two-parameter family of determinants, we find closed forms for several one-parameter subfamilies. The interest in these determinants arises because they count cyclically symmetric rhombus tilings of a hexagon with several triangular holes inside.


Full work available at URL: https://arxiv.org/abs/1709.02616





Cites Work


Cited In (7)

Uses Software


Recommendations





This page was built for publication: A curious family of binomial determinants that count rhombus tilings of a holey hexagon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000656)