Advanced computer algebra for determinants

From MaRDI portal
Publication:368447

DOI10.1007/S00026-013-0183-8zbMATH Open1276.33032arXiv1112.0647OpenAlexW3104826190MaRDI QIDQ368447FDOQ368447

Christoph Koutschan, Thotsaporn Thanatipanonda

Publication date: 23 September 2013

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We prove three conjectures concerning the evaluation of determinants, which are related to the counting of plane partitions and rhombus tilings. One of them was posed by George Andrews in 1980, the other two were by Guoce Xin and Christian Krattenthaler. Our proofs employ computer algebra methods, namely, the holonomic ansatz proposed by Doron Zeilberger and variations thereof. These variations make Zeilberger's original approach even more powerful and allow for addressing a wider variety of determinants. Finally, we present, as a challenge problem, a conjecture about a closed-form evaluation of Andrews's determinant.


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




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: Advanced computer algebra for determinants

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