Proving hypergeometric identities by numerical verifications
From MaRDI portal
Proper and \(q\)-proper hypergeometric identities can be certified by checking a finite number \(n\) of initial values. The authors give a new method to estimate \(n\). The given examples show that the new estimates are smaller than the previous results.
Recommendations
- An improvement of the two-line algorithm for proving \(q\)-hypergeometric identities.
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Rational Functions Certify Combinatorial Identities
- A two-line algorithm for proving \(q\)-hypergeometric identities
- A two-line algorithm for proving terminating hypergeometric identities
Cites work
- A new elementary algorithm for proving \(q\)-hypergeometric identities
- A two-line algorithm for proving \(q\)-hypergeometric identities
- A two-line algorithm for proving terminating hypergeometric identities
- All binomial identities are verifiable
- An improvement of the two-line algorithm for proving \(q\)-hypergeometric identities.
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- On Zeilberger's algorithm and its \(q\)-analogue
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
- Sister Celine's technique and its generalizations
- Some generalized hypergeometric polynomials
Cited in
(4)
This page was built for publication: Proving hypergeometric identities by numerical verifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999090)