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 produc
✦ LIBER ✦
qMultiSum—a package for proving q-hypergeometric multiple summation identities
✍ Scribed by Axel Riese
- Book ID
- 104344814
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 375 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
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 discovered identities are exhibited.
📜 SIMILAR VOLUMES
A new elementary algorithm for proving q
✍
Bao-Yin Zhang
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 105 KB
An $SU(n)$ q -Beta Integral Transformati
✍
Denis, R. Y.; Gustafson, R. A.
📂
Article
📅
1992
🏛
Society for Industrial and Applied Mathematics
🌐
English
⚖ 760 KB