A computer proof of a polynomial identity implying a partition theorem of Göllnitz

From MaRDI portal
Publication:696795

DOI10.1006/AAMA.2001.0764zbMATH Open1021.11027arXivmath/0102106OpenAlexW2041103088MaRDI QIDQ696795FDOQ696795


Authors: Alexander Berkovich, Axel Riese Edit this on Wikidata


Publication date: 12 September 2002

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0102106




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: A computer proof of a polynomial identity implying a partition theorem of Göllnitz

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696795)