Computer Science – Symbolic Computation
Scientific paper
2011-12-03
Computer Science
Symbolic Computation
16 pages
Scientific paper
We prove three conjectures concerning the evaluation of determinants, which are related to the counting of plane partitions and rhombus tilings. One of them has been posed by George Andrews in 1980, the other two are 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.
Koutschan Christoph
Thanatipanonda Thotsaporn "Aek"
No associations
LandOfFree
Advanced Computer Algebra for Determinants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Advanced Computer Algebra for Determinants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Advanced Computer Algebra for Determinants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-697893