Vol. 31, No. 3, 1969

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Vol. 324: 1  2
Vol. 323: 1  2
Vol. 322: 1  2
Online Archive
The Journal
About the journal
Ethics and policies
Peer-review process
Submission guidelines
Submission form
Editorial board
ISSN: 1945-5844 (e-only)
ISSN: 0030-8730 (print)
Special Issues
Author index
To appear
Other MSP journals
On a calculus of partition functions

George E. Andrews

Vol. 31 (1969), No. 3, 555–562

The main object in this paper is to show that many partition theorems which have been deduced from identities in basic hypergeometric series and infinite products may in fact be given purely combinatorial proofs. We show that the manipulations performed on the generating functions have combinatorial interpretations, and thus we obtain a “calculus of partition functions” which translates a sizable portion of the techniques of the elementary theory of basic hypergeometric series into arithmetic terms.

Mathematical Subject Classification
Primary: 05.10
Secondary: 10.00
Received: 5 May 1969
Published: 1 December 1969
George E. Andrews
Department of Mathematics
The Pennsylvania State University
109 McAllister Building
University Park PA 16802-7000
United States