MacMahon's Partition Analysis: II Fundamental Theorems
- Published:
- Volume 4, pages 327–338, (2000)
- Cite this article
Abstract.
We continue the study of the method outlined by MacMahon in Section VIII of [10]. The long range object is to show the relevance of MacMahon's ideas in current partition-theoretic research. In this paper we present a number of theorems which MacMahon overlooked. For example, the number of partitions of n with non-negative first and second differences between parts equals the number of partitions of n into triangular numbers.
This is a preview of subscription content, to check access.
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
Similar content being viewed by others
Applications of Faà di Bruno’s formula to partition traces
On Generalizations of Theorems of MacMahon and Subbarao
P.A. MacMahon: Ramanujan’s Distinguished Contemporary
Explore related subjects
Discover the latest articles, books and news in related subjects, suggested using machine learning.Additional information
Received April 21, 1999
Rights and permissions
About this article
Cite this article
Andrews, G. MacMahon's Partition Analysis: II Fundamental Theorems. Annals of Combinatorics 4, 327–338 (2000). https://doi.org/10.1007/PL00001284
Issue date:
DOI: https://doi.org/10.1007/PL00001284
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
