A curious family of binomial determinants that count rhombus tilings of a holey hexagon
DOI10.1016/j.jcta.2019.03.001zbMath1416.05039arXiv1709.02616OpenAlexW2750593470WikidataQ128095779 ScholiaQ128095779MaRDI QIDQ2000656
Christoph Koutschan, Thotsaporn ``Aek Thanatipanonda
Publication date: 28 June 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.02616
nonintersecting lattice pathsholonomic functionsrhombus tilingsymbolic summationbinomial determinantDesnanot-Jacobi-Dodgson identityLindström-Gessel-Viennot lemmaZeilberger's holonomic ansatz
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Determinants, permanents, traces, other special matrix functions (15A15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Advanced computer algebra for determinants
- Descending plane partitions and rhombus tilings of a hexagon with a triangular hole
- Binomial determinants, paths, and hook length formulae
- Plane partitions. III: The weak Macdonald conjecture
- Advanced determinant calculus
- A curious family of binomial determinants that count rhombus tilings of a holey hexagon
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
- Advanced determinant calculus: a complement
- Proof of George Andrews’s and David Robbins’s q -TSPP conjecture
- On the Vector Representations of Induced Matroids
- Enumeration of Lozenge tilings of hexagons with a central triangular hole
- Determinants through the looking glass