MacMahon's Double Vision: Partition Diamonds Revisited
Matthias Beck, Kobe Wijesekera

TL;DR
This paper revisits the concept of partition diamonds, extending their analysis to d-fold cases using Stanley's P-partitions and deriving a closed-form generating function involving Euler–Mahonian polynomials.
Contribution
It introduces a new approach to d-fold partition diamonds via P-partitions and provides a closed-form generating function generalizing previous recursive formulas.
Findings
Derived a closed-form generating function for d-fold partition diamonds.
Connected partition diamonds with Euler–Mahonian polynomials and permutation statistics.
Extended the theory of partition diamonds to higher dimensions.
Abstract
Plane partition diamonds were introduced by Andrews, Paule, and Riese (2001) as part of their study of MacMahon's -operator in search for integer partition identities. More recently, Dockery, Jameson, Sellers, and Wilson (2024) extended this concept to -fold partition diamonds and found their generating function in a recursive form. We approach -fold partition diamonds via Stanley's (1972) theory of -partitions and give a closed formula for a bivariate generalization of the Dockery--Jameson--Sellers--Wilson generating function; its main ingredient is the Euler--Mahonian polynomial encoding descent statistics of permutations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Random Matrices and Applications
