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

Simple item page
dc.creatorBerkovich, A.
dc.creatorRiese, A.
dc.date2001-02-14
dc.date.accessioned2026-07-07T04:40:09Z
dc.date.available2026-07-07T04:40:09Z
dc.descriptionIn 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.
dc.description12 pages, to appear in Adv. Appl. Math
dc.identifierhttps://arxiv.org/abs/math/0102106
dc.identifierhttp://arxiv.org/abs/math/0102106
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60938
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subjectQuantum Algebra
dc.subject05A19, 05A30, 11P82, 33F10
dc.titleA computer proof of a polynomial identity implying a partition theorem of Goellnitz
dc.typetext

Files

Collections

arXiv