# A Nekrasov-Okounkov type formula for affine $\tilde{C}$

Mathias Pétréolle

► To cite this version:

Mathias Pétréolle. A Nekrasov-Okounkov type formula for affine $\tilde{C}$. 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015), Jul 2015, Daejeon, South Korea. pp.535-546, 10.46298/dmtcs.2498 . hal-01337795

HAL Id: hal-01337795

https://hal.science/hal-01337795

Submitted on 27 Jun 2016

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
# A Nekrasov-Okounkov type formula for $\tilde{C}$

Mathias Pétréolle¹†

¹ Institut Camille Jordan, Lyon, France

**Abstract.** In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\tilde{A}$. In this paper, we obtain new combinatorial expansions of powers of $\eta$, in terms of partition hook lengths, by using Macdonald's identity in type $\tilde{C}$ and a new bijection. As applications, we derive a symplectic hook formula and a relation between Macdonald's identities in types $\tilde{C}$, $\tilde{B}$, and $\tilde{BC}$.

**Résumé.** En 2008, Han a redécouvert un développement des puissances de la fonction $\eta$ de Dedekind, dû à Nekrasov et Okounkov, en utilisant l'identité de Macdonald en type $\tilde{A}$. Dans cet article, nous obtenons un nouveau développement combinatoire des puissances de $\eta$, en termes de longueurs d'équerres de partitions, en utilisant l'identité de Macdonald en type $\tilde{C}$ ainsi qu'une nouvelle bijection. Plusieurs applications en sont déduites, comme un analogue symplectique de la formule des équerres, ou une relation entre les identités de Macdonald en types $\tilde{C}$, $\tilde{B}$ et $\tilde{BC}$.

**Keywords:** Macdonald's identities, Dedekind $\eta$ function, affine root systems, integer partitions, t-cores

## 1 Introduction

Recall the Dedekind $\eta$ function, which is a weight 1/2 modular form, defined as follows:

$$ \eta(x) = x^{1/24} \prod_{k \ge 1} (1 - x^k), \qquad (1) $$

where $|x| < 1$ (we will assume this condition all along this paper). Apart from its modular properties, due to the factor $x^{1/24}$, this function plays a fundamental role in combinatorics, as it is related to the generating function of integer partitions. Studying expansions of powers of $\eta$ is natural, in the sense that it yields a certain amount of interesting questions both in combinatorics and number theory, such as Lehmer's famous conjecture (see for instance [7]). In 2006, in their study of the theory of Seiberg-Witten on supersymmetric gauges in particle physics [6], Nekrasov and Okounkov obtained the following formula:

$$ \prod_{k \ge 1} (1 - x^k)^{z-1} = \sum_{\lambda \in \mathcal{P}} x^{\lambda |\lambda|} \prod_{h \in \mathcal{H}(\lambda)} \left(1 - \frac{z}{h^2}\right), \qquad (2) $$

where $\mathcal{P}$ is the set of integer partitions and $\mathcal{H}(\lambda)$ is the multiset of hook lengths of $\lambda$ (see Section 2 for precise definitions). In 2008, this formula was rediscovered and generalized by Han [2], through two main

<footnote>†Email: petreolle@math.univ-lyon1.fr.</footnote>
tools, one arising from an algebraic context and the other from a more combinatorial one. From this result, Han derived many applications in combinatorics and number theory, such as the marked hook formula or a reformulation of Lehmer's conjecture. Formula (2) was next proved and generalized differently by Iqbal et al. in 2013 [3] by using plane partitions, Cauchy's formula for Schur function and the notion of topological vertex.

The proof of Han uses on the one hand a bijection between t-cores and some vectors of integers, due to Garvan, Kim and Stanton in their proof of Ramanujan's congruences [1]. Recall that t-cores had originally been introduced in representation theory to study some characters of the symmetric group [4]. On the other hand, Han uses Macdonald's identity for affine root systems. It is a generalization of Weyl's formula for finite root systems R which can itself be written as follows:

$$ \prod_{\alpha > 0} (e^{\alpha/2} - e^{-\alpha/2}) = \sum_{w \in W(R)} \varepsilon(w) e^{w\rho}, \qquad (3) $$

where the sum is over the elements of the Weyl group $W(R)$, $\varepsilon$ is the sign, and $\rho$ is an explicit vector depending on $W(R)$. Here, the product ranges over the positive roots $R^+$, and the exponential is formal. Macdonald specialized his formula for several affine root systems and exponentials. In all cases, when the formal exponential is mapped to the constant function equal to 1, the product side can be rewritten as an integral power of Dedekind $\eta$ function. In particular, the specialization used in [2] corresponds to the type $A_t$, for an odd positive integer $t$, and reads (here $\|\cdot\|$ is the euclidean norm):

$$ \eta(x)^{t^2-1} = c_0 \sum_{\mathbf{v}} x^{\|\mathbf{v}\|^2/2t} \prod_{i<j} (v_i - v_j), \quad \text{with } c_0 := \frac{(-1)^{(t-1)/2}}{1!2!\cdots(t-1)!}, \qquad (4) $$

where the sum is over t-tuples $\mathbf{v} := (v_0, \dots, v_{t-1}) \in \mathbb{Z}^t$ such that $v_i \equiv i \mod t$ and $v_0 + \dots + v_{t-1} = 0$. Han next uses a refinement of the aforementioned bijection to transform the right-hand side into a sum over partitions, and proves (2) for all odd integers $t$. Han finally transforms the right-hand side through very technical considerations to show that (2) is in fact true for all complex number $t$. A striking remark is that the factor of modularity $x^{(t^2-1)/24}$ in $\eta(x)^{t^2-1}$ cancels naturally in the proof when the bijection is used.

This approach immediately raises a question, which was asked by Han in [2]: can we use specializations of Macdonald's formula for other types to find new combinatorial expansions of the powers of $\eta$? In the present paper, we give a positive answer for the case of type $\tilde{C}$ and, as shall be seen later, for types $\tilde{B}$ and $\tilde{BC}$. In the case of type $\tilde{C}_t$, for an integer $t \ge 2$, Macdonald's formula reads:

$$ \eta(x)^{2t^2+t} = c_1 \sum_{\mathbf{v}} x^{\|\mathbf{v}\|^2/(4t+4)} \prod_i v_i \prod_{i<j} (v_i^2 - v_j^2), \quad \text{with } c_1 := \frac{(-1)^{\lfloor t/2 \rfloor}}{1!3!\cdots(2t+1)!}, \qquad (5) $$

where the sum ranges over t-tuples $\mathbf{v} := (v_1, \dots, v_t) \in \mathbb{Z}^t$ such that $v_i \equiv i \mod 2t+2$. The first difficulty in providing an analogue of (2) through (5) is to find which combinatorial objects should play the role of the partitions $\lambda$. Our main result is the following possible answer.

**Theorem 1** For any complex number $t$, with the notations and definitions of Section 2, the following expansion holds:

$$ \prod_{k \ge 1} (1 - x^k)^{2t^2 + t} = \sum_{\lambda \in DD} \delta_{\lambda} x^{\lambda/2} \prod_{h \in \mathcal{H}(\lambda)} \left( 1 - \frac{2t + 2}{h \varepsilon_h} \right), \qquad (6) $$
where the sum is over doubled distinct partitions, $\delta_\lambda$ is equal to 1 (resp. -1) if the Durfee square of $\lambda$ is of even (resp. odd) size, and $\epsilon_h$ is equal to -1 if $h$ is the hook length of a box strictly above the diagonal and to 1 otherwise.

To prove this, we will use (5) and a bijection obtained through results of [1]. Many applications can be derived from Theorem 1, which we are able to generalize with more parameters as did Han for (2). However, we will only highlight two consequences, a combinatorial one and a more algebraic one. The first is the following symplectic analogue of the famous hook formula (see for instance [8]), valid for any positive integer $n$:

$$ \sum_{\substack{\lambda \in DD \\ |\lambda| = 2n}} \prod_{h \in \mathcal{H}(\lambda)} \frac{1}{h} = \frac{1}{2^n n!} \qquad (7) $$

The second, which is expressed in Theorem 6, is a surprising link between the family of Macdonald's formulas in type $\tilde{C}_t$ (for all integers $t \ge 2$), the one in type $\tilde{B}_t$ (for all integers $t \ge 3$), and the one in type $\tilde{BC}_t$ (for all integers $t \ge 1$).

The paper is organized as follows. In Section 2, we recall the definitions and notations regarding partitions, $t$-cores, self-conjugate and doubled distinct partitions. Section 3 is devoted to sketching the proof of Theorem 1 using a new bijection between the already mentioned subfamilies of partitions and some vectors of $\mathbb{Z}^t$, and its properties that we will explain. In Section 4, we derive some applications from Theorem 1, such as the symplectic hook formula (7), and the connection between (5) and Macdonald's identities in types $\tilde{B}$ and $\tilde{BC}$, which are shown in Theorem 6 to be all generalized by Theorem 1.

# 2 Integer partitions and $t$-cores

In all this section, $t$ is a fixed positive integer.

## 2.1 Definitions

We recall the following definitions, which can be found in [8]. A partition $\lambda = (\lambda_1, \lambda_2, \dots, \lambda_\ell)$ of the integer $n \ge 0$ is a finite non-increasing sequence of positive integers whose sum is $n$. The $\lambda_i$'s are the parts of $\lambda$, $\ell := \ell(\lambda)$ is its length, and $n$ its weight, denoted by $|\lambda|$. Each partition can be represented by its Ferrers diagram as shown in Figure 1, left. (Here we represent the Ferrers diagram in French convention.)

<figure><img src="image_2.png" /><figcaption>**Figure 1:** The Ferrers diagram of the partition $(7, 5, 3, 2, 2, 1, 1)$, a principal hook and the hook lengths.</figcaption></figure>

For each box $v = (i, j)$ in the Ferrers diagram of $\lambda$ (with $i \in \{1, \dots, \ell\}$ and $j \in \{1, \dots, \lambda_i\}$), we define the hook of $v$ as the set of boxes $u$ such that either $u$ lies on the same row and above $v$, or $u$ lies on the same column and on the right of $v$. The hook length of $v$ is the cardinality of the hook of $v$ (see Figure 1,
right). The hook of $v$ is called *principal* if $v = (i, i)$ (i.e. $v$ lies on the diagonal of $\lambda$, see Figure 1, center). The *Durfee square* of $\lambda$ is the greatest square included in its Ferrers diagram, the length of its side is the Durfee length, denoted by $D(\lambda)$: it is also the number of principal hooks. We denote by $\delta_\lambda$ the number $(-1)^{D(\lambda)}$.

**Definition 1** Let $\lambda$ be a partition. We say that $\lambda$ is a $t$-core if and only if no hook length of $\lambda$ is a multiple of $t$.

Recall [2] that $\lambda$ is a $t$-core if and only if no hook length of $\lambda$ is equal to $t$. We denote by $\mathcal{P}$ the set of partitions and by $\mathcal{P}(t)$ the subset of $t$-cores.

**Definition 2** Let $\lambda$ be a partition. The $t$-core of $\lambda$ is the partition $T(\lambda)$ obtained from $\lambda$ by removing in its Ferrers diagram all the ribbons of length $t$, and by repeating this operation until we can not remove any ribbon.

<figure><img src="image_3.png" /><figcaption>**Figure 2:** The construction of the 3-core of the partition $\lambda = (7, 6, 4, 2, 2, 1)$. In grey, the deleted ribbons.</figcaption></figure>

The definition of ribbons can be found in [8], see Figure 2 for an example. Note that $T(\lambda)$ does not depend on the order of removal (see [8, p. 468] for a proof). In particular, as a ribbon of length $t$ corresponds bijectively to a box with hook length $t$, the $t$-core $T(\lambda)$ of a partition $\lambda$ is itself a $t$-core.

## 2.2 $t$-cores of partitions

We will need restrictions of a bijection from [1] to two subsets of $t$-cores. First, we recall this bijection. Let $\lambda$ be a $t$-core, we define the vector $\phi(\lambda) := (n_0, n_1, \ldots, n_{t-1})$ as follows. We label the box $(i, j)$ of $\lambda$ by $(j-i)$ modulo $t$. We also label the boxes in the (infinite) column 0 in the same way, and we call the resulting diagram the *extended $t$-residue diagram* (see Figure 3 below). A box is called *exposed* if it is at the end of a row of the extended $t$-residue diagram. The set of boxes $(i, j)$ of the extended $t$-residue diagram satisfying $t(r-1) \le j-i < tr$ is called a *region* and labeled $r$. We define $n_i$ as the greatest integer $r$ such that the region labeled $r$ contains an exposed box with label $i$.

**Theorem 2 ([1]** The map $\phi$ is a bijection between $t$-cores and vectors of integers $\mathbf{n} = (n_0, n_1, \ldots, n_{t-1}) \in \mathbb{Z}^t$, satisfying $n_0 + \cdots + n_{t-1} = 0$, such that:

$$|\lambda| = \frac{t \|\mathbf{n}\|^2}{2} + \mathbf{b} \cdot \mathbf{n} = \frac{t}{2} \sum_{i=0}^{t-1} n_i^2 + \sum_{i=0}^{t-1} in_i, \qquad (8)$$

where $\mathbf{b} := (0, 1, \ldots, t-1)$, $\|\mathbf{n}\|$ is the euclidean norm of $\mathbf{n}$, and $\mathbf{b} \cdot \mathbf{n}$ is the scalar product of $\mathbf{b}$ and $\mathbf{n}$.

For example, the 3-core $\lambda = (7, 5, 3, 1, 1)$ of Figure 3 satisfies $\phi(\lambda) = (3, -2, -1)$. We indeed have $7 + 5 + 3 + 1 + 1 = 17 = |\lambda| = \frac{3}{2}(9 + 4 + 1) - 2 - 2$.
<figure><img src="image_4.png" /><figcaption>**Figure 3:** The extended 3-residue diagram of the 3-core $\lambda = (7, 5, 3, 1, 1)$. The exposed boxes are circled.</figcaption></figure>

## 2.3 Self-conjugate t-cores

Next we come to the definition of a subfamily of $P(t)$ which naturally appears in the proof of our type $\tilde{C}$ formula. We define self-conjugate t-cores as elements $\lambda$ in $P(t)$ satisfying $\lambda = \lambda^*$, where $\lambda^*$ is the conjugate of $\lambda$ (see [8]). We denote by $SC(t)$ the set of self-conjugate t-cores and by $\lfloor t/2 \rfloor$ the greatest integer smaller or equal to $t/2$.

**Proposition 1** There is a bijection $\phi_1$ between the partitions $\lambda \in SC(t)$ and vectors of integers $\phi_1(\lambda) := n \in \mathbb{Z}^{\lfloor t/2 \rfloor}$, such that:

$$ |\lambda| = t \|n\|^2 + c \cdot n, \quad \text{with } c := \begin{cases} (1, 3, \dots, t-1) & \text{for } t \text{ even,} \\ (2, 4, \dots, t-1) & \text{for } t \text{ odd.} \end{cases} \qquad (9) $$

Moreover, the image of a self-conjugate t-core $\lambda$ under $\phi_1$ is the vector whose components are the $\lfloor t/2 \rfloor$ last ones of $\phi(\lambda)$. This proposition is essentially proved in [1].

For example, the self-conjugate 3-core $\lambda$ of Figure 1 satisfies $\phi(\lambda) = (3, 0, -3)$; therefore its image under $\phi_1$ is the vector $(-3)$.

## 2.4 t-cores of doubled distinct partitions

We will also need a second subfamily of $P(t)$ in our proof of Theorem 1. Let $\mu^0$ be a partition with distinct parts. We denote by $S(\mu^0)$ the shifted Ferrers diagram of $\mu^0$, which is its Ferrers diagram where for all $1 \le i \le \ell(\mu^0)$, the $i^{th}$ row is shifted by $i$ to the right (see Figure 4 below).

**Definition 3 ([1])** We define the doubled distinct partition $\mu$ of $\mu^0$ as the partition whose Ferrers diagram is obtained by adding $\mu_i^0$ boxes to the $i^{th}$ column of $S(\mu^0)$ for all $1 \le i \le \ell(\mu^0)$. We denote by DD the set of doubled distinct partitions and by $DD(t)$ the subset of t-cores in DD.
<figure><img src="image_5.png" /><figcaption>**Figure 4:** The construction of the doubled distinct partition $\mu$, for $\mu^0 = (4, 1)$.</figcaption></figure>

**Proposition 2** There is a bijection $\phi_2$ between the partitions $\mu \in DD_{(t)}$ and vectors of integers $\phi_2(\mu) := n \in \mathbb{Z}^{\lfloor(t-1)/2\rfloor}$, such that:

$$ |\mu| = t \|\mathbf{n}\|^2 + \mathbf{d} \cdot \mathbf{n}, \quad \text{with } \mathbf{d} := \begin{cases} (2, 4, \dots, t-2) & \text{for } t \text{ even,} \\ (1, 3, \dots, t-2) & \text{for } t \text{ odd.} \end{cases} \qquad (10) $$

Besides, the image of a doubled distinct t-core $\mu$ under $\phi_2$ is the vector whose components are the $\lfloor(t-1)/2\rfloor$ last ones of $\phi(\mu)$. Again, Proposition 2 is essentially proved in [1].

For example, the doubled distinct 3-core $\mu = (5, 3, 1, 1)$ of Figure 4, right, satisfies $\phi(\mu) = (0, 2, -2)$; so its image under $\phi_2$ is the vector $(-2)$.

## 2.5 Generating function of $SC_{(t)} \times DD_{(t)}$

We will now focus on pairs of t-cores in the set $SC_{(t)} \times DD_{(t)}$. We can in particular compute the generating function of these objects. Let $(\lambda, \mu)$ be an element of $SC_{(t)} \times DD_{(t)}$. We define the weight of $(\lambda, \mu)$ as $|\lambda| + |\mu|$, and we denote by $h_t$ the generating function

$$ h_t(q) := \sum_{(\lambda, \mu) \in SC_{(t)} \times DD_{(t)}} q^{|\lambda| + |\mu|}. \qquad (11) $$

We would like to mention that the first step towards discovering Theorem 1 was the computation of the Taylor expansion of $h_3(q)$, whose first terms seemed to coincide with the ones in the generating function of the vectors of integers involved in (5) for $t = 2$.

**Proposition 3** The following equality holds for any integer $t \ge 0$:

$$ h_{t+1}(q) = \frac{(q^2; q^2)_\infty}{(q; q)_\infty} (q^{t+1}; q^{t+1})_\infty (q^{2t+2}; q^{2t+2})_{\infty}^{t-1}, \quad \text{where } (q; q)_\infty := \prod_{j \ge 1} (1 - q^j). \qquad (12) $$

**Proof:** Both generating functions of $SC_{(t)}$ and $DD_{(t)}$ are already known (see [1]). The idea of the proof, that we will not detail, is to compute their product, which can be done by considering the parity of $t$. To conclude, it remains to use Sylvester's bijection between partitions with odd parts and partitions with distinct parts in order to simplify and unify the resulting expressions. $\square$

# 3 A Nekrasov-Okounkov type formula in type $\tilde{C}$

The goal of this section is to sketch the proof of Theorem 1.
The global strategy is the following: we start from Macdonald's formula (5) in type $\tilde{C}_t$, in which we replace the sum over vectors of integers by a sum over pairs of $t+1$-cores, the first in $SC_{(t+1)}$, and the second in $DD_{(t+1)}$. To do this, we need a new bijection $\varphi$ satisfying some properties that we will explain. This will allow us to establish Theorem 4 of Section 3.2 below for all integers $t \ge 2$. An argument of polynomiality will then enable us to extend this theorem to any complex number $t$. Then, a natural bijection between pairs $(\lambda, \mu)$ in $SC \times DD$, and doubled distinct partitions (with weight equal to $|\lambda| + |\mu|$) will allow us to conclude. Note that at this final step, the partitions need not be $t+1$-cores.

## 3.1 The bijection $\varphi$

In what follows, we assume that $t \ge 2$ is an integer.

**Definition 4** If $(\lambda, \mu)$ is a pair belonging to $SC_{(t+1)} \times DD_{(t+1)}$, we denote by $\Delta$ the set of principal hook lengths of $\lambda$ and $\mu$, and for all $i \in \{1, \dots, t\}$ we define

$$ \Delta_i := \operatorname{Max} (\{h \in \Delta, h \equiv \pm j - t - 1 \mod 2t + 2\} \cup \{i - t - 1\}). \quad (13) $$

For example, for $\lambda = (7, 5, 3, 2, 2, 1, 1)$, $\mu = (5, 3, 1, 1)$ and $t+1=3$, we have $\Delta = \{13, 8, 7, 2, 1\}$, $\Delta_1 = 8$, and $\Delta_2 = 13$ (see Figure 5).

<figure><img src="image_6.png" /><figcaption>**Figure 5:** Computation of $\Delta$, $\Delta_1$ and $\Delta_2$ for a $(\lambda, \mu) \in SC_{(3)} \times DD_{(3)}$.</figcaption></figure>

As $\lambda$ (resp. $\mu$) is self-conjugate (resp. doubled distinct), all of its principal hook lengths are odd (resp. even). The knowledge of the set $\Delta$ enables us to reconstruct uniquely both partitions $\lambda$ and $\mu$. The following theorem shows that in fact, when these two partitions are $t+1$-cores, it is enough to know the $\Delta_i$'s to recover $\lambda$ and $\mu$ (so knowing the hook length maxima in each congruency class modulo $2t+2$ is enough).

**Theorem 3** Set $e := (1, 2, \dots, t)$. There is a bijection $\varphi$ between $SC_{(t+1)} \times DD_{(t+1)}$ and $\mathbb{Z}^t$ such that $\varphi(\lambda, \mu) := n = (n_1, \dots, n_t)$ satisfies:

$$ |\lambda| + |\mu| = (t+1)\|n\|^2 + e \cdot n = (t+1) \sum_{i=1}^{t} (n_i^2 + in_i). \quad (14) $$

Besides, the following relation holds for all integers $i \in \{1, \dots, t\}$:

$$ t + 1 + \Delta_i = \sigma_i((2t + 2)n_i + i), \quad (15) $$

where $\sigma_i$ is equal to 1 (resp. -1) if $n_i \ge 0$ (resp. $n_i < 0$).
We can be more explicit about the construction of $\varphi$. Recall the bijections $\phi_1$ and $\phi_2$ defined in Propositions 1 and 2. If $(t+1)$ is odd, then $n_{2i}$ (resp. $n_{2i+1}$) is the $i^{th}$ component of $\phi_1(\lambda)$ (resp. $\phi_2(\mu)$); and if $(t+1)$ is even, $n_{2i}$ (resp. $n_{2i+1}$) is the $i^{th}$ component of $\phi_2(\mu)$ (resp. $\phi_1(\lambda)$).

It is then easy to prove that $\varphi$ is a bijection. The key property, which is hard to prove, is the one expressed in (15); we do not give the proof here.

For example, the pair of 3-cores $(\lambda, \mu)$ of Figure 5 satisfies $\varphi(\lambda, \mu) = (-2, -3)$. We have $31 = |\lambda| + |\mu| = 3(4+9) + 1(-2) + 2(-3)$. Moreover, $\Delta_1 = 8$, $\Delta_2 = 13$. We verify that $3 + \Delta_1 = 11 = -(6n_1 + 1)$, and $3 + \Delta_2 = 16 = -(6n_2 + 2)$.

The inverse of $\varphi$ can be recursively described as follows. Fix a vector $\mathbf{n} = (n_1, \dots, n_t)$ in $\mathbb{Z}^t$, then

* if all the $n_i$'s are equal to zero, then $\lambda$ and $\mu$ are empty,

* if a $n_i$ is equal to 1, then the corresponding partition $(\lambda$ or $\mu$, depending on the parity of $i$) contains a principal hook of length $t+1+i$,

* if a $n_i$ is equal to $-1$, then the corresponding partition contains a principal hook of length $t+1-i$,

* the preimage of $(n_1, \dots, n_i+1, \dots, n_t)$ if $n_i > 0$ (resp. $(n_1, \dots, n_i-1, \dots, n_t)$ if $n_i < 0$) is the preimage of $(n_1, \dots, n_i, \dots, n_t)$ in which we add in the corresponding partition a principal hook of length $(t+1)(2n_i-1)+i$ (resp. $(t+1)(-2n_i-1)-i$).

**Remark 1** There are three immediate consequences of the previous recursive description of $\varphi^{-1}$.

(i) There can not be in $\Delta$ both a principal hook length equal to $i+t+1 \mod 2t+2$ and a principal hook length equal to $-i+t+1 \mod 2t+2$.

(ii) If $h > 2t+2$ belongs to $\Delta$, then $h-2t-2$ also belongs to $\Delta$.

(iii) If a finite subset of $\mathbb{N}$ verifies the two former properties (i) and (ii) and does not contain any element equal to zero modulo $2t+2$, then it is the set $\Delta$ of a pair of $(t+1)$-cores $(\lambda, \mu) \in DD_{(t+1)} \times SC_{(t+1)}$.

By using our bijection $\varphi$, and by setting $v_i = (2t+2)n_i + i$ for $1 \le i \le t$, we can replace the sum in Macdonald's formula (5) by a sum over pairs $(\lambda, \mu) \in DD_{(t+1)} \times SC_{(t+1)}$ (and not over vectors of integers). Therefore (5) takes the form (recall that $\sigma_i$ is equal to 1 (resp. $-1$) if $n_i \ge 0$ (resp. $n_i < 0$)):

$$ \prod_{k \ge 1} (1 - x^k)^{2t^2 + t} = c_1 \sum_{\lambda, \mu} x^{|\lambda| + |\mu|} \prod_i (2t + 2n_i + i) \prod_{i<j} ((2t + 2n_i + i)^2 - (2t + 2n_j + j)^2) \quad (16) $$

$$ = c_1 \sum_{\lambda, \mu} x^{|\lambda| + |\mu|} \prod_i \sigma_i (t + 1 + \Delta_i) \prod_{i<j} ((t + 1 + \Delta_i)^2 - (t + 1 + \Delta_j)^2). \quad (17) $$

## 3.2 Simplification of coefficients

The next step towards proving Theorem 1 is a simplification of both products on the right-hand side of (17), in such a way that they do not depend on the $\Delta_i$'s (and more generally, that they do not depend on congruency classes modulo $2t+2$). To do that, we need the following notion defined in [2], but only for odd integers.

**Definition 5** A finite set of integers $A$ is a $2t+2$-compact set if and only if the following conditions hold:

(i) $-1, -2, \dots, -2t-1$ belong to $A$;

(ii) for all $a \in A$ such that $a \ne -1, -2, \dots, -2t-1$, we have $a \ge 1$ and $a \ne 0 \mod 2t+2$;

(iii) let $b > a \ge 1$ be two integers such that $a \equiv b \mod 2t+2$. If $b \in A$, then $a \in A$.
Let A be a $2t + 2$-compact set. An element $a \in A$ is $2t + 2$-maximal if for any element $b > a$ such that $a \equiv b \pmod{2t+2}$, $b \notin A$ (i.e. a is maximal in its congruency class modulo $2t+2$). The set of $2t + 2$-maximal elements is denoted by $\max_{2t+2}(A)$. It is clear by definition of compact sets that A is uniquely determined by $\max_{2t+2}(A)$. We can show the following lemma, whose proof is analogous to the one of [2], but in the even case.

**Lemma 1** For any $2t + 2$-compact set A, we have:

$$ - \prod_{a \in A, a > 0} \left( 1 - \left( \frac{2t+2}{a} \right)^2 \right) = \prod_{a \in \max_{2t+2}(A)} \frac{a+2t+2}{a}. \qquad (18) $$

Now the strategy is to do an induction on the number of principal hooks of the pairs $(\lambda, \mu)$ appearing in (17). The two following lemmas are the first step; their proofs are omitted due to their technical complexities and lengths.

Let $(\lambda, \mu)$ be in $SC_{(t+1)} \times DD_{(t+1)}$ with $\lambda$ or $\mu$ non empty, and let $\Delta$ be the set of principal hook lengths of $\lambda$ and $\mu$, from which we can define the $\Delta_i$'s as in Definition 4. We denote by $h_{11}$ the maximal element of $\Delta$. We denote by $(\lambda', \mu') \in SC_{(t+1)} \times DD_{(t+1)}$ the pair obtained by deleting the principal hook of length $h_{11}$. We denote by $\Delta'$ the set of principal hook lengths of $\lambda'$ and $\mu'$, and consider its associated $\Delta_i'$s.

**Lemma 2** If $i_0$ is the (unique) integer such that $\Delta_{i_0} = h_{11}$, then we have:

$$ \prod_i \frac{\sigma_i(t+1+\Delta_i)}{\sigma'_i(t+1+\Delta'_i)} \prod_{i<j} \frac{(t+1+\Delta_i)^2 - (t+1+\Delta_j)^2}{(t+1+\Delta'_i)^2 - (t+1+\Delta'_j)^2} = \left(1 - \frac{2t+2}{h_{11}}\right) \left(1 - \frac{t+1}{h_{11}}\right) \times \left(\frac{h_{11}+t+1}{h_{11}-t-1}\right) \left(\frac{h_{11}}{h_{11}-2t-2}\right) \left(\frac{2h_{11}}{2h_{11}-2t-2}\right) \prod_{j \neq i_0} \frac{(h_{11}+\Delta_j+2t+2)(h_{11}-\Delta_j)}{(h_{11}+\Delta_j)(h_{11}-\Delta_j-2t-2)}. \quad (19) $$

**Lemma 3** With the same notations as above, we define the set

$$ E := \bigcup_{j \neq i_0} \{h_{11} + \Delta_j, h_{11} - \Delta_j - 2t - 2\} \cup \{h_{11} - t - 1, h_{11} - 2t + 2, 2h_{11} - 2t + 2\}. \quad (20) $$

Then E is the $\max_{2t+2}(H)$ of a unique $2t + 2$-compact set H, which is independent of $t+1$. Moreover, its subset $H_{>0}$ of positive elements is made of elements of the form $h_{11} + \tau_{jj}$, where $1 \le j \le h_{11} - 1$, and $\tau_j$ is equal to 1 if j is a principal hook length (i.e. $j \in \Delta$) and to -1 otherwise.

Now, we are able to derive the following lemma.

**Lemma 4** If $(\lambda, \mu)$ is in $SC_{(t+1)} \times DD_{(t+1)}$ and $(n_1, \dots, n_t) := \varphi(\lambda, \mu)$, then the following equality holds:

$$ \prod_i (2t + 2n_i + i) \prod_{i<j} ((2t + 2n_i + i)^2 - (2t + 2n_j + j)^2) \qquad (21) $$

$$ = \frac{\delta_{\lambda} \delta_{\mu}}{c_1} \prod_{h_{ii} \in \Delta} \left(1 - \frac{2t+2}{h_{ii}}\right) \left(1 - \frac{t+1}{h_{ii}}\right) \prod_{j=1}^{h_{ii}-1} \left(1 - \left(\frac{2t+2}{h_{ii} + \tau_{jj}}\right)^2\right), \quad (22) $$

where $\delta_{\lambda}$ and $\delta_{\mu}$ are defined in Section 2.1.
**Proof:** Let us just show the idea of the proof. Starting from (21), we transform by using $\varphi$ the products into products involving the $\Delta_i$'s, as we did for identifying (16) and (17). Next we do an induction on the cardinality of $\Delta$. To do this, we delete in $\lambda$ or $\mu$ the hook corresponding to the largest element of $\Delta$, and we rewrite the product over the $\Delta_i$'s by using Lemma 2. The successive right-hand sides of (19), obtained by doing the induction, can be simplified into the products on the right-hand side of (22) by using Lemmas 1 and 3. There are $D(\lambda) + D(\mu)$ steps in the induction, each of which giving rise to a minus sign. This explains the term $\delta_\lambda\delta_\mu$. The base case corresponds to empty partitions $\lambda$ and $\mu$. In this case $\Delta_i = i - t - 1, 1 \le i \le t$, therefore

$$ \prod_i \sigma_i(t+1+\Delta_i) \prod_{i<j} ((t+1+\Delta_i)^2 - (t+1+\Delta_j)^2) = \prod_i i \prod_{i<j} (i^2 - j^2) = \frac{1}{c_1}. \quad (23) $$

□

We can finally prove the following result, which will be seen to be equivalent to Theorem 1.

**Theorem 4** The following identity holds for any complex number $t$:

$$ \prod_{n \ge 1} (1 - x^n)^{2t^2 + t} = \sum_{(\lambda, \mu)} \delta_{\lambda} \delta_{\mu} x^{|\lambda| + |\mu|} \prod_{h_{ii} \in \Delta} \left(1 - \frac{2t + 2}{h_{ii}}\right) \left(1 - \frac{t + 1}{h_{ii}}\right)^{h_{ii} - 1} \prod_{j=1}^{h_{ii} - 1} \left(1 - \left(\frac{2t + 2}{h_{ii} + \tau_{jj}}\right)^2\right), \quad (24) $$

where the sum ranges over pairs $(\lambda, \mu)$ of partitions, $\lambda$ being self-conjugate and $\mu$ being doubled distinct.

**Proof:** Thanks to Macdonald's formula (5) and Lemma 4, equation (24) holds if the sum on the right-hand side is over pairs $(\lambda, \mu) \in SC_{(t+1)} \times DD_{(t+1)}$ and if $t$ is a positive integer. We will show that the product

$$ Q := \prod_{h_{ii} \in \Delta} \left(1 - \frac{2t + 2}{h_{ii}}\right) \left(1 - \frac{t + 1}{h_{ii}}\right)^{h_{ii} - 1} \prod_{j=1}^{h_{ii} - 1} \left(1 - \left(\frac{2t + 2}{h_{ii} + \tau_{jj}}\right)^2\right) \quad (25) $$

vanishes if the pair $(\lambda, \mu)$ is not a pair of $t+1$-cores. Indeed, set $(\lambda, \mu) \in SC \times DD$, and let $\Delta$ be the set of principal hook lengths of $\lambda$ and $\mu$. We show that $Q$ vanishes unless $\Delta$ verifies the three hypotheses of (iii) in Remark 1. Assume $Q \neq 0$.

First, let $h_{ii} > 2t+2$ be an element of $\Delta$. If $h_{ii} - 2t - 2$ was not a principal hook length, then the term corresponding to $j = h_{ii} - 2t - 2$ in the second product of $Q$ would vanish by definition of $\tau_j$. So (ii) is satisfied.

Second, let $k, k'$ be nonnegative integers. If $(2k+1)(t+1)+i$ and $(2k'+1)(t+1)-i$ both belonged to $\Delta$, then by induction and according to the previous case, the product $Q$ would vanish if $t+1+i$ and $t+1-i$ did not belong to $\Delta$. But if $t+1+i$ and $t+1-i$ belonged to $\Delta$, the term $1 - \left(\frac{2t+2}{(t+1+i)+(t+1-i)}\right)^2$ would vanish. So $(2k+1)(t+1)+i$ and $(2k'+1)(t+1)-i$ can not be both principal hook lengths if $Q$ is nonzero. So $(i)$ is satisfied.

Third, if $\Delta$ contains multiples of $t+1$, we denote by $h_{ii}$ the smallest such principal hook length. If $h_{ii} = t+1$ or $h_{ii} = 2t+2$, then the first term of the product $Q$ would vanish. Otherwise, $h_{ii} - 2t - 2$ does not belong to $\Delta$ by minimality, and so the term corresponding to $j = h_{ii} - 2t + 2$ in the second product of $Q$ would vanish.
According to Remark 1, if $Q \neq 0$, then $(\lambda, \mu)$ is a pair of $(t+1)$-cores. So formula (24) remains true for any positive integer $t$ if the sum ranges over $SC \times DD$. To conclude, we give a polynomiality argument which generalizes (24) to all complex numbers $t$. To this aim, we can use the following formula:

$$ \prod_{k \geq 1} \frac{1}{1 - x^k} = \exp \left( \sum_{k \geq 1} \frac{x^k}{k(1 - x^k)} \right), \qquad (26) $$

in order to rewrite the left-hand side of (24) in the following form:

$$ \exp \left( -(2t^2 + t) \sum_{k \geq 1} \frac{x^k}{k(1 - x^k)} \right). \qquad (27) $$

Let $m$ be a nonnegative integer. The coefficient $C_m(t)$ of $x^m$ on the left-hand side of (24) is a polynomial in $t$, according to (27), as is the coefficient $D_m(t)$ of $x^m$ on the right-hand side. Formula (24) is true for all integers $t \geq 2$, it is therefore still true for any complex number $t$. $\square$

Let $(\lambda, \mu)$ be in $SC \times DD$, with set of principal hook lengths $\Delta$. We denote by $2\Delta$ the set of elements of $\Delta$ multiplied by 2. Note that we can uniquely associate to $(\lambda, \mu)$ a partition $\nu \in DD$ with set of principal hook lengths $2\Delta$.

**Theorem 5** The partition $\nu$ satisfies $|\lambda| + |\mu| = |\nu|/2$, $\delta_{\lambda}\delta_{\mu} = \delta_{\nu}$, and:

$$ \prod_{h_{ii} \in \Delta} \left(1 - \frac{2t + 2}{h_{ii}}\right) \left(1 - \frac{t + 1}{h_{ii}}\right) \prod_{j=1}^{h_{ii}-1} \left(1 - \left(\frac{2t + 2}{h_{ii} + \tau_{jj}}\right)^2\right) = \prod_{h \in \nu} \left(1 - \frac{2t + 2}{h \varepsilon_h}\right), \qquad (28) $$

where $\varepsilon_h$ is equal to $-1$ if $h$ is the hook length of a box strictly above the principal diagonal, and to $1$ otherwise.

We omit the proof here; the difficult point being (28), whose proof uses an induction on the number of principal hooks. With Theorems 4 and 5, Theorem 1 straightforwardly follows.

# 4 Some applications

We give here some of the many applications of Theorem 1. First, taking $t = -1$ in (6) yields the following famous expansion, where the sum ranges over partitions with distinct parts:

$$ \prod_{n \geq 1} (1 - x^n) = \sum_{\lambda} (-1)^{\#\{\text{parts of } \lambda\}} x^{|\lambda|}. \qquad (29) $$

Second, from (6), (2) and the classical hook formula (see for instance [8]), we derive its following symplectic analogue, valid for any positive integer $n$:

$$ \sum_{\substack{\lambda \in DD \\ |\lambda| = 2n}} \prod_{h \in \mathcal{H}(\lambda)} \frac{1}{h} = \frac{1}{2^{n}n!}. \qquad (30) $$

Finally, we can prove the following theorem, which is surprising regarding the right-hand sides of the formulas, and which establishes a link between Macdonald's formulas in types $\tilde{C}$, $\tilde{B}$, and $\tilde{BC}$.
**Theorem 6** The following families of formulas are all generalized by Theorem 1:

(i) Macdonald's formula (5) in type $\tilde{C}_t$ for any integer $t \ge 2$;

(ii) Macdonald's formula in type $\tilde{B}_t$ for any integer $t \ge 3$:

$$ \eta(x)^{2t^2+t} = c_1 \sum_{\mathbf{v}} x^{\|\mathbf{v}\|^2/8(2t-1)} \prod_i v_i \prod_{i<j} (v_i^2 - v_j^2), \quad (31) $$

where the sum ranges over t-tuples $\mathbf{v} := (v_1, \dots, v_t) \in \mathbb{Z}^t$ such that $v_i \equiv 2i - 1 \pmod{4t - 2}$ and $v_1 + \dots + v_t = t^2 \pmod{8t - 4}$;

(iii) Macdonald's formula in type $\tilde{B}\tilde{C}_t$ for any integer $t \ge 1$:

$$ \eta(x)^{2t^2-t} = c_2 \sum_{\mathbf{v}} x^{\|\mathbf{v}\|^2/8(2t+1)} (-1)^{(v_1+\dots+v_t-t)/2} \prod_{i<j} (v_i^2 - v_j^2), \quad \text{with } c_2 := \frac{(-1)^{(t-1)/2} t!}{1! 2! \dots (t-1)!}, \quad (32) $$

where the sum ranges over t-tuples $\mathbf{v} := (v_1, \dots, v_t) \in \mathbb{Z}^t$ such that $v_i \equiv 2i - 1 \pmod{4t + 2}$.

**Proof:** Here we do not give details of the proof (due to its length) and just present the ideas. By substituting $u := -t - 1/2$ in (6), and considering the positive integral values of $u$, we first prove that the product on the right-hand side vanishes for all partitions $\lambda$, except for those such that $\lambda$ does not contain a hook length equal to $2u - 1$ for boxes strictly above the diagonal. By using some lemmas analogous to Lemmas 1-4 (in the reverse sense) and a bijection analogous to $\phi$, we manage to derive Macdonald's formula in type $\tilde{B}_u$ for any integer $u \ge 3$. The same reasoning applies for type $\tilde{B}\tilde{C}_\ell$ by doing the substitution $\ell := t - 1/2$ for integers $\ell \ge 1$. The partitions $\lambda$ that occur here are $2\ell + 1$-cores. $\square$

A natural question, and to which we were not able to answer, which arises is the following: is there a generalization analogous to Theorem 1 for type $\tilde{D}$?

## References

[1] F. Garvan, D. Kim, D. Stanton, *Cranks and t-Cores*, Invent. Math. **1** (1990), pp. 771–778.

[2] G. Han, *The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extensions and applications*, Ann. Inst. Fourier **1** (2010), pp. 1–29.

[3] A. Iqbal, S. Nazir, Z. Raza, Z. Saleem, *Generalizations of Nekrasov-Okounkov Identity*, Ann. Comb. **16** (2012), pp. 745–753.

[4] J. Gordon, A. Kerber, *The representation theory of the symmetric group*, Encyclopedia of Mathematics and its Applications, **16**, Addison-Wesley Publishing, MA, 1981.

[5] I. G. Macdonald, *Affine Root Systems and Dedekind's $\eta$-Function*, Invent. Math. **2** (1972), pp. 91–143.

[6] N. A. Nekrasov, A. Okounkov, *Seiberg-Witten theory and random partitions*, The unity of Mathematics, Progr. Math., **244** (2006), pp. 525–596.

[7] J. P. Serre, *Cours d'arithmétique*, Collection SUP: "Le Mathématicien", Presses Universitaires de France, Paris 1970.

[8] R. P. Stanley, *Enumerative Combinatorics, vol. 2*, Cambridge University Press, 1999.