A generalization of a partition theorem of MacMahon

DOI10.1016/S0021-9800(67)80022-XMaRDI QIDQ5537419zbMATH OpenOpenAlexFDO

Authors George E. Andrews

Publication date 1967

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(67)80022-x

zbMATH Keywords

combinatorics

Cited in

(11)

• A variant of \texttt{IdentityFinder} and some new identities of Rogers-Ramanujan-MacMahon type
• Partition identities
• Bijective proofs of partition identities of Macmahon, Andrews, and Subbarao
• A note on the Andrews-Ericksson-Petrov-Romick bijection for MacMahon's partition theorem
• On the Andrews-Zagier asymptotics for partitions without sequences
• On a Partition Theorem of MacMahon-Andrews
• On generalizations of theorems of MacMahon and Subbarao
• Partition theorems and the Chinese remainder theorem
• Some enumerative applications of cyclotomic polynomials
• A refinement of and a companion to MacMahon's partition identity
• Partition identities and the coin exchange problem

This page was built for publication: A generalization of a partition theorem of MacMahon

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