A new elementary algorithm for proving \(q\)-hypergeometric identities

DOI10.1016/S0747-7171(02)00136-0zbMath1020.33006MaRDI QIDQ1401154

Bao-Yin Zhang

Publication date: 17 August 2003

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

zbMATH Keywords

eliminationcomputer proofs\(q\)-hypergeometric identities

Mathematics Subject Classification ID

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

Related Items (1)

Proving hypergeometric identities by numerical verifications

Cites Work

• Unnamed Item
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Sister Celine's technique and its generalizations
• A two-line algorithm for proving \(q\)-hypergeometric identities

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