 |
|
|
|
|
 |
|
|
A Computer Proof of a Polynomial Identity Implying a Partition Theorem of Göllnitz
|
|
|
|
|
|
| Organization: | Pennsylvania State University |
| Organization: | Johannes Kepler University |
| Department: | Research Institute for Symbolic Computation |
|
|
|
|
|
|
| Advances in Applied Mathematics |
|
|
|
|
|
|
In this paper we give a comuter proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we rovide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer proofs are done with the aid of the new computer algebra package qMultiSum developed by the second author. qMultiSum implements an algorithmic refinement of Wilf and Zeilberger's multi-q-extension of Sister Celine's technique utilizing additional ideas of Verbaeten and Wegschaider.
|
|
|
|
|
|
|
|
|
|
|
|
Göllnitz's theorem, Jacobi and Euler functions, computer proof
|
|
For the newest resources, visit Wolfram Repositories and Archives »
