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

DOI10.1006/AAMA.2001.0764MaRDI QIDQ696795zbMATH OpenOpenAlexFDO

Authors Alexander Berkovich, Axel Riese

Publication date 12 September 2002

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

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

zbMATH Keywords

partitions\(q\)-binomial coefficientsmathematica packageqMultiSumGöllnitz's theorem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Partitions; congruences and congruential restrictions (11P83)

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.

Recommendations

• scientific article; zbMATH DE number 2188357
• scientific article; zbMATH DE number 2063235
• An analogue of Euler's identity and new combinatorial properties of n-colour compositions
• Rogers-Ramanujan identities for n-color partitions
• A THEOREM ON SEVEN-COLORED OVERPARTITIONS AND ITS APPLICATIONS
• Publication:4502697
• scientific article; zbMATH DE number 7692844
• Some identities concerning partition functions and divisor sums
• scientific article; zbMATH DE number 1153447
• Some new identities for colored partition

Cites work

• scientific article; zbMATH DE number 194092 (Why is no real title available?)
• scientific article; zbMATH DE number 727111 (Why is no real title available?)
• scientific article; zbMATH DE number 2063235 (Why is no real title available?)
• A double bounded version of Schur's partition theorem
• A quartic key identity for a partition theorem of Göllnitz
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Partitionen mit Differenzenbedingungen.
• \texttt{qMultiSum} -- a package for proving \(q\)-hypergeometric multiple summation identities

Cited in

(6)

• \texttt{qMultiSum} -- a package for proving \(q\)-hypergeometric multiple summation identities
• A Priori Solution Estimates for Nonlinear Vector Integral Equations
• New polynomial analogues of Jacobi's triple product and Lebesgue's identities
• Creative telescoping for holonomic functions
• Computer-assisted proofs of congruences for multipartitions and divisor function convolutions, based on methods of differential algebra
• \(q\)-hypergeometric proofs of polynomial analogues of the triple product identity, Lebesgue's identity and Euler's pentagonal number theorem

Describes a project that uses

Uses Software

• Mathematica
• qMultiSum

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)