English

A Nekrasov-Okounkov Type formula for $\widetilde{C}$

Combinatorics 2015-09-16 v2 Number Theory

Abstract

In 2008, Han rediscovered an expansion of powers of Dedekind η\eta 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 A~\widetilde{A} affine root systems. In this paper, we obtain new combinatorial expansions of powers of η\eta, in terms of partition hook lengths, by using the Macdonald identity in type C~\widetilde{C} and a new bijection between vectors with integral coordinates and a subset of tt-cores for integer partitions. As applications, we derive a symplectic hook formula and an unexpected relation between the Macdonald identities in types C~\widetilde{C}, B~\widetilde{B}, and BC~\widetilde{BC}. We also generalize these expansions through the Littlewood decomposition and deduce in particular many new weighted generating functions for subsets of integer partitions and refinements of hook formulas.

Cite

@article{arxiv.1505.01295,
  title  = {A Nekrasov-Okounkov Type formula for $\widetilde{C}$},
  author = {Mathias Pétréolle},
  journal= {arXiv preprint arXiv:1505.01295},
  year   = {2015}
}

Comments

33 pages, 13 figures. This is the long version of the extended abstract accepted for FPSAC conference

R2 v1 2026-06-22T09:28:58.980Z