A computer proof of a polynomial identity implying a partition theorem of Goellnitz

Details A computer proof of a polynomial identity implying a partition theorem of Goellnitz A computer proof of a polynomial identity implying a partition theorem of Goellnitz

2001-02-14

arxiv.org/abs/math/0102106v1

Mathematics

Combinatorics

12 pages, to appear in Adv. Appl. Math

Scientific paper

In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide 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.

Affiliated with

Also associated with

No associations

Rating

A computer proof of a polynomial identity implying a partition theorem of Goellnitz does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A computer proof of a polynomial identity implying a partition theorem of Goellnitz, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A computer proof of a polynomial identity implying a partition theorem of Goellnitz will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432992