Proving hypergeometric identities by numerical verifications

DOI10.1016/J.JSC.2008.05.003zbMath1173.33304OpenAlexW2087998665WikidataQ112882107 ScholiaQ112882107MaRDI QIDQ999090

Qiang-Hui Guo, Qing-Hu Hou, Lisa Hui Sun

Publication date: 30 January 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.05.003

zbMATH Keywords

heightdegreenumerical verificationhypergeometric identities

Mathematics Subject Classification ID

Generalized hypergeometric series, ({}_pF_q) (33C20) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (2)

On the length of integers in telescopers for proper hypergeometric terms ⋮ Creative Telescoping for Holonomic Functions

Uses Software

• NewZeil.m
• ZEILBERGER
• qZEILBERGER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sister Celine's technique and its generalizations
• Hypergeometric solutions of linear recurrences with polynomial coefficients
• On Zeilberger's algorithm and its \(q\)-analogue
• A two-line algorithm for proving \(q\)-hypergeometric identities
• An improvement of the two-line algorithm for proving \(q\)-hypergeometric identities.
• A new elementary algorithm for proving \(q\)-hypergeometric identities
• A two-line algorithm for proving terminating hypergeometric identities
• Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
• All binomial identities are verifiable
• Some generalized hypergeometric polynomials

This page was built for publication: Proving hypergeometric identities by numerical verifications