Advanced Computer Algebra for Determinants
Symbolic Computation
2013-08-19 v3 Combinatorics
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.
Cite
@article{arxiv.1112.0647,
title = {Advanced Computer Algebra for Determinants},
author = {Christoph Koutschan and Thotsaporn "Aek" Thanatipanonda},
journal= {arXiv preprint arXiv:1112.0647},
year = {2013}
}
Comments
16 pages