A combinatorial proof of Buryak-Feigin-Nakajima
Eve Vidalis

TL;DR
This paper provides a purely combinatorial proof of a generating function formula for partition statistics related to cores and quotients, extending previous geometric and combinatorial methods.
Contribution
It introduces a refined multigraph and involution to prove equidistribution of partition statistics, offering a new combinatorial proof of a result by Buryak, Feigin, and Nakajima.
Findings
Constructed a multigraph $M_{r,s,c}$ that refines Loehr and Warrington's graphs.
Proved the equidistribution of a family of partition statistics using an involution.
Derived a generating function formula for partitions with fixed cores.
Abstract
Buryak, Feigin and Nakajima computed a generating function for a family of partition statistics by using the geometry of the fixed point sets in the Hilbert scheme of points on . Loehr and Warrington had already shown how a similar observation by Haiman using the geometry of the Hilbert scheme of points on could be made purely combinatorial. We extend the techniques of Loehr and Warrington to also account for cores and quotients. In particular, we construct a multigraph that is a direct refinement of Loehr and Warrington's multigraphs , retains the relevant partition data, and is preserved by an involution which we use to prove the equidistribution of a family of partition statistics. As a consequence, we obtain a purely combinatorial proof of a result of Buryak, Feigin, and Nakajima. More precisely, we define a family of partition…
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 · Functional Equations Stability Results
