MacMahon's partition analysis. XIV: Partitions with \(n\) copies of \(n\)

DOI10.1016/j.jcta.2023.105836OpenAlexW4389087154MaRDI QIDQ6187336

Paule, Peter, George E. Andrews

Publication date: 15 January 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2023.105836

zbMATH Keywords

partitions\(q\)-seriespartition analysisoverpartitionsRadu's Ramanujan-Kolberg algorithmmodular forms and partition congruencespartitions with \(n\) copies of \(n\)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Elementary theory of partitions (11P81)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithmic approach to Ramanujan-Kolberg identities
• Eight-vertex SOS model and generalized Rogers-Ramanujan-type identities
• Rogers-Ramanujan identities for partitions with n copies of n
• An algorithm to prove algebraic relations involving eta quotients
• Proofs of some conjectures on the reciprocals of the Ramanujan-Gordon identities
• MacMahon's partition analysis XIII: Schmidt type partitions and modular forms
• On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm
• Partition analysis, modular functions, and computer algebra
• Ramanujan's Theta Functions
• Some identities involving the partition function
• Overpartitions
• Congruences for the reciprocals of the Ramanujan–Gordon identities
• Separable integer partition classes
• Further Identities of the Rogers-Ramanujan Type
• MacMahon's partition analysis. VIII: Plane partition diamonds

This page was built for publication: MacMahon's partition analysis. XIV: Partitions with \(n\) copies of \(n\)