vix.ing · top · new · best · stats · spec

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

2001/02/14 by Alexander Bérkovich, A. Berkovich, Axel Riese +3
Mathematics · #05A19 #05A30 #11P82 #33F10 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #Mathematical functions and polynomials #Number Theory (math.NT) #Quantum Algebra (math.QA) #math.CO #math.NT #math.QA #msc:05A19 #msc:05A30 #msc:11P82 #msc:33F10

paper · pdf · doi:10.48550/arxiv.math/0102106

12 pages, to appear in Adv. Appl. Math

arxiv created 2001/02/14 · openalex publication_date 2001/02/14 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related