Advanced computer algebra for determinants
From MaRDI portal
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.
Recommendations
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
- A curious family of binomial determinants that count rhombus tilings of a holey hexagon
- Binomial determinants for tiling problems yield to the holonomic ansatz
- Advanced determinant calculus: a complement
- Determinants through the looking glass
Cites work
- scientific article; zbMATH DE number 3989352 (Why is no real title available?)
- A holonomic systems approach to special functions identities
- Advanced applications of the holonomic systems approach. (Abstract of thesis)
- Advanced determinant calculus
- Advanced determinant calculus: a complement
- Determinants through the looking glass
- Enumeration of Lozenge tilings of hexagons with a central triangular hole
- Proof of George Andrews's and David Robbins's \(q\)-TSPP conjecture
- Reverend Charles to the Aid of Major Percy and Fields Medalist Enrico
- The generating function of ternary trees and continued fractions
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
- Zeilberger's holonomic ansatz for Pfaffians
Cited in
(12)- D.H. Lehmer's tridiagonal determinant: an étude in (Andrews-inspired) experimental mathematics
- A curious family of binomial determinants that count rhombus tilings of a holey hexagon
- Binomial determinants for tiling problems yield to the holonomic ansatz
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
- Creative telescoping for holonomic functions
- Advanced determinant calculus: a complement
- Determinants through the looking glass
- Inverse inequality estimates with symbolic computation
- A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
- Advanced determinant calculus
- Determinant evaluations inspired by Di Francesco's determinant for twenty-vertex configurations
- Zeilberger's holonomic ansatz for Pfaffians
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)