𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new elementary algorithm for proving q-hypergeometric identities

✍ Scribed by Bao-Yin Zhang

Book ID
104344812
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
105 KB
Volume
35
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We give a fast elementary algorithm to get a small number n 1 for an admissible q-proper-

such that we can prove the identity by checking its correctness for n (n 0 ≀ n ≀ n 1 ). For example, we get n 1 = 191 for the q-Vandermonde-Chu identity, n 1 = 70 for a finite version of Jacobi's triple product identity and n 1 = 209 for an identity due to L.J. Rogers.

πŸ“œ SIMILAR VOLUMES

qMultiSumβ€”a package for proving q-hyperg
qMultiSumβ€”a package for proving q-hypergeometric multiple summation identities
✍ Axel Riese πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 375 KB

A Mathematica package for finding recurrences for q-hypergeometric multiple sums is introduced. Together with a detailed description of the theoretical background, we present several examples to illustrate its usage and range of applicability. In particular, various computer proofs of recently disco

A Two-Line Algorithm for Provingq-Hyperg
A Two-Line Algorithm for Provingq-Hypergeometric Identities
✍ Lily Yen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 206 KB

We show that q-hypergeometric identities Ý F n, k s 1 can be proved by k checking that they are correct for only finitely many, N say, values of n. We give a specific a priori formula for N, as a polynomial of degree 24 in the parameters of Ž . F n, k . We see this because of the presence of ''q'',

A Mathematica Version of Zeilberger's Al
A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities
✍ Peter Paule; Markus Schorn πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 665 KB

Based on Gosper's algorithm for indefinite hypergeometric summation, Zeilberger's algorithm for proving binomial coefficient identities constitutes a recent breakthrough in symbolic computation. Mathematica implementations of these algorithms are described. Nontrivial examples are given in order to