A Nekrasov-Okounkov Type formula for $\widetilde{C}$
Mathias P\'etr\'eolle

TL;DR
This paper extends combinatorial formulas for powers of the Dedekind eta function using type c4; Macdonald identities, revealing new relations and generating functions for partitions.
Contribution
It introduces new combinatorial expansions of eta powers via type c4; Macdonald identities and a novel bijection, expanding understanding of partition hook lengths.
Findings
Derived a symplectic hook formula
Established relations between Macdonald identities in types c4, b2, and bc
Produced new weighted generating functions for partitions
Abstract
In 2008, Han rediscovered an expansion of powers of Dedekind function attributed to Nekrasov and Okounkov (which was actually first proved the same year by Westbury) by using a famous identity of Macdonald in the framework of type affine root systems. In this paper, we obtain new combinatorial expansions of powers of , in terms of partition hook lengths, by using the Macdonald identity in type and a new bijection between vectors with integral coordinates and a subset of -cores for integer partitions. As applications, we derive a symplectic hook formula and an unexpected relation between the Macdonald identities in types , , and . We also generalize these expansions through the Littlewood decomposition and deduce in particular many new weighted generating functions for subsets of integer…
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 · Algebraic structures and combinatorial models
