A new elementary algorithm for proving q-hypergeometric identities

DOI10.1016/S0747-7171(02)00136-0MaRDI QIDQ1401154zbMATH OpenFDO

Authors Bao-Yin Zhang

Publication date 17 August 2003

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

Full work available at URL https://doi.org/10.1016/S0747-7171(02)00136-0

zbMATH Keywords

\(q\)-hypergeometric identitiescomputer proofselimination

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Review text

The author gives a fast elementary algorithm to get a small number \(n_1\) for an admissible \(q\)-proper-hypergeometric identity \(\sum_k F(n,k)= G(n)\), \(n\geq n_0\). Some examples are given.

Cites work

• A two-line algorithm for proving \(q\)-hypergeometric identities
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• Sister Celine's technique and its generalizations

Cited in

(3)

• An algorithm to prove algebraic relations involving eta quotients
• scientific article; zbMATH DE number 1023404 (Why is no real title available?)
• Proving hypergeometric identities by numerical verifications

This page was built for publication: A new elementary algorithm for proving \(q\)-hypergeometric identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401154)