A Nekrasov-Okounkov type formula for type C
Mathias P\'etr\'eolle

TL;DR
This paper extends Nekrasov-Okounkov type formulas for powers of the Dedekind eta function to type C, using Macdonald's identity and combinatorial bijections, revealing new formulas and relations among types.
Contribution
It introduces a new combinatorial expansion of eta powers for type C using Macdonald's identity and a novel bijection, expanding the understanding of these identities.
Findings
Derived a symplectic hook formula.
Established relations between Macdonald's identities in types C, B, and BC.
Provided new combinatorial expansions of eta powers.
Abstract
In 2008, Han rediscovered an expansion of powers of Dedekind function due to Nekrasov and Okounkov by using Macdonald's identity in type . In this paper, we obtain new combinatorial expansions of powers of , in terms of partition hook lengths, by using Macdonald's identity in type and a new bijection. As applications, we derive a symplectic hook formula and a relation between Macdonald's identities in types , , and .
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
TopicsAlgebraic structures and combinatorial models · Advanced Mathematical Identities · Advanced Combinatorial Mathematics
