Some combinatorial interpretations of the Macdonald identities for affine root systems and Nekrasov--Okounkov type formulas

This paper establishes a combinatorial framework linking integer vectors and partitions viewed as bi-infinite words to derive enumerations of hook length products, thereby providing Schur-function-based interpretations of Macdonald identities for all affine root systems and yielding corresponding $q$-Nekrasov–Okounkov formulas.

The Gist

Imagine you are looking at a giant, infinite library. Inside this library, there are two very different ways of organizing books:

1. The "Hook" Method: Imagine a bookshelf where every book has a specific "hook" attached to it. The length of this hook depends on how many books are to its right and below it. Some books have long hooks, some have short ones.
2. The "Vector" Method: Imagine a long, endless string of beads, some black and some white, stretching infinitely in both directions.

For decades, mathematicians knew there was a secret connection between these two methods, but it was like trying to translate a poem from a language no one speaks anymore. This paper, by David Wahiche, acts as a new, clear dictionary that translates between these two worlds.

Here is a breakdown of what the paper does, using simple metaphors:

1. The Big Discovery: Two Ways to Count

The author shows that you can take a specific arrangement of books (called an integer partition) and translate it into a specific pattern of black and white beads (a bi-infinite word).

• The Analogy: Think of a partition as a staircase made of blocks. The "Hook Length" is like measuring the distance from any block to the edge of the staircase.
• The Magic: The paper proves that if you multiply all these hook lengths together, it tells you something profound about the pattern of beads. Conversely, if you know the pattern of beads, you can predict the hook lengths.

2. The "Macdonald Identities": The Secret Recipes

In the mathematical world, there are famous "recipes" called Macdonald Identities. These are complex formulas that link sums (adding things up) to products (multiplying things together).

• The Problem: For a long time, these recipes were written in a very abstract language involving "root systems" (which are like geometric skeletons of shapes). It was hard to see the actual "books" or "beads" inside the formula.
• The Solution: Wahiche rewrites these recipes. Instead of just seeing abstract numbers, he shows that these recipes are actually counting specific types of bookshelves (partitions).
  • Some recipes count "Self-Conjugate" bookshelves (shelves that look the same if you hold them up to a mirror).
  • Others count "Doubled Distinct" shelves (shelves with a very specific, symmetrical shape).

3. The "Nekrasov–Okounkov" Formulas: The Universal Translator

The paper takes these rewritten recipes and turns them into a new set of formulas called Nekrasov–Okounkov formulas.

• The Analogy: Imagine you have a universal translator that can take a complex mathematical sentence and turn it into a simple song about hook lengths.
• What it does: These formulas allow mathematicians to calculate the "weight" of these bookshelves using a variable called $q$ (which acts like a dial).
  • When you turn the dial to a specific setting, you get a formula for one type of bookshelf.
  • When you turn it to another setting, you get a formula for a different type.
  • The paper provides these "dial settings" for seven different families of mathematical shapes (affine root systems), which is a huge expansion from what was known before.

4. Solving a Mystery

The paper mentions an "open problem" from a mathematician named Han. Han asked: "We have this amazing formula for one type of shape (Type A). Do similar formulas exist for the other six types?"

• The Answer: Yes! Wahiche uses his "bead-to-bookshelf" translation method to find the missing formulas for all the other types. He even solves a puzzle about what happens when you turn the dial all the way to the end (when $q$ goes to 1), revealing a new way to understand old mathematical products (Euler products).

Summary

Think of this paper as a master key.

• Before: Mathematicians had a key that only opened one door (one type of shape).
• Now: Wahiche has forged a master key that opens seven doors.
• How: By realizing that the complex patterns of beads (vectors) and the simple patterns of blocks (partitions with hooks) are actually two sides of the same coin.

The paper doesn't just say "here is a formula"; it explains why the formula works by showing the physical, combinatorial structure (the hooks and the beads) hidden inside the abstract math. It connects the world of "hook lengths" (combinatorics) with the world of "root systems" (algebra) in a way that makes the invisible visible.

Technical Summary

Technical Summary: Combinatorial Interpretations of Macdonald Identities and Nekrasov–Okounkov Formulas

Problem Statement
The paper addresses the combinatorial interpretation of Macdonald identities for the seven infinite families of affine root systems. While the classical Nekrasov–Okounkov formula (Type $A^{(1)}_{t-1}$) connects a sum over integer partitions weighted by hook lengths to an infinite product, the existence of analogous formulas for other affine types (Types $B, C, D$ and their twisted variants) remained an open question, specifically highlighted in Han's work [Han09, Problem 6.4]. The challenge lies in translating the abstract sums over affine Weyl groups and quadratic forms found in Macdonald identities into concrete enumerative formulas involving partitions, hook lengths, and Schur functions. Furthermore, the paper seeks to derive $q$-analogues (Nekrasov–Okounkov type formulas) for all 13 specializations of Macdonald identities provided in [Mac72].

Methodology
The author employs a methodology centered on the correspondence between integer partitions and bi-infinite binary words (often referred to as Maya diagrams or abaci). The core technical tools include:

1. Binary Word Correspondence: Partitions are mapped to sequences $(c_k)_{k \in \mathbb{Z}}$ where steps along the Ferrers diagram border are encoded as 0s (vertical) and 1s (horizontal). This allows for a precise definition of hook lengths and the main diagonal via indices in the word.
2. Littlewood Decomposition: The paper utilizes the Littlewood decomposition, which maps a partition $\lambda$ to a $t$-core $\omega$ and a $t$-quotient $\nu$. The author extends this framework to specific subsets of partitions: self-conjugate ($SC$), doubled distinct ($DD$), and their conjugates ($DD'$).
3. $V_{g,t}$-Coding: A novel coding scheme is introduced (Definition 4.10) that maps specific subsets of partitions to vectors of integers. This coding bridges the gap between the quadratic forms appearing in the exponents of Macdonald identities and the weights (sizes) of specific partition subsets.
4. Inductive Enumeration: The paper proves enumerative results for products of hook lengths on these specific subsets by induction on the maximal element of the $V_{g,t}$-coding. This involves removing the largest hook (or part) and analyzing the resulting change in the coding vector.
5. Schur Function Specialization: The sum side of the Macdonald identities, originally expressed as sums over lattices, is rewritten as sums over Schur functions (classical, symplectic, special orthogonal, and even orthogonal) indexed by partitions derived from the $V_{g,t}$-coding.

Key Contributions and Results

1. Combinatorial Interpretation of Macdonald Identities:
   The paper provides a uniform rewriting of the Macdonald identities for all seven infinite affine root systems ($\tilde{A}_{t-1}, \tilde{B}_t, \tilde{B}^\vee_t, \tilde{C}_t, \tilde{C}^\vee_t, \tilde{D}_t, \widetilde{BC}_t$).

   • The sum side is expressed as a sum over specific families of partitions (e.g., $t$-cores for Type $A$, doubled distinct partitions for Type $C$, self-conjugate partitions for Type $D^{(2)}$).
   • The terms in the sum involve signed weights (determined by the size of the Durfee square and the number of hook lengths below a threshold) and Schur functions corresponding to the classical Lie groups associated with the affine type (e.g., symplectic Schur functions for Type $C^{(1)}_t$, special orthogonal for $B^{(1)}_t$).
   • Theorem 1.2 and Theorem 1.3 exemplify this for Types $A^{(1)}_{t-1}$ and $C^{(1)}_t$, respectively.

2. Enumeration of Hook Length Products:
   The author derives explicit formulas for the product of hook lengths (and their signed variants) for the identified partition families.

   • Theorem 4.14 provides a general formula for the product $\prod_{s \in \omega} \frac{\tau(h_s - \epsilon_s g)}{\tau(h_s)}$ for $g$-cores in the doubled distinct set $DD(g)$.
   • Analogous theorems (4.19, 4.21, 4.23, 4.25, 4.27) are established for the other partition families, linking the product to determinants involving the $V_{g,t}$-coding vectors.

3. Derivation of $q$-Nekrasov–Okounkov Formulas:
   By specializing the variables in the rewritten Macdonald identities (setting $x_i = q^i$ or $x_i = q^{2i-1}$) and utilizing the hook length enumeration results, the paper derives $q$-Nekrasov–Okounkov formulas for all infinite affine types.

   • Theorem 1.4 presents the formula for Type $C^{(1)}_t$.
   • Theorems 6.5, 6.7, 6.9, 6.11, and 6.13 provide the corresponding formulas for Types $B^{(1)}_t$, $A^{(2)}_{2t-1}$, $D^{(2)}_{t+1}$, $A^{(2)}_{2t}$, and $D^{(1)}_t$.
   • These formulas generalize the classical Nekrasov–Okounkov identity, incorporating parameters $u$ and $q$ that reflect the specific root system structure.

4. Limit Cases and Open Problems:
   By taking the limit $q \to 1$ (or $q \to -1$) and applying polynomiality arguments, the paper derives 13 distinct Nekrasov–Okounkov type formulas corresponding to the specializations in Macdonald's Appendix 1.

   • This resolves the open problem posed by Han regarding the existence of such identities for other types.
   • The paper recovers known results (e.g., for Type $A$ and specific cases of Type $C$ and $D$ found in [Pé15a, Pé15b]) and derives new formulas for previously unaddressed specializations (e.g., Eq. 6.13, 6.15, 6.17, 6.19, 6.21).

Significance
The paper claims significance in providing a unified combinatorial framework that connects the abstract algebraic structure of Macdonald identities for affine root systems to concrete partition statistics. By establishing a bijection between the quadratic forms in the identities and the weights of specific partition subsets via the $V_{g,t}$-coding, the author translates the "sum over the affine Weyl group" into a "sum over partitions." This not only offers a combinatorial interpretation of Macdonald identities in terms of Schur functions but also systematically generates a family of Nekrasov–Okounkov formulas for all infinite affine types. The work answers a specific open question regarding the existence of these formulas for types other than $A$, thereby extending the scope of hook-length formulas in combinatorics and representation theory. The author notes that while the approach could theoretically extend to exceptional types, the bounded rank of these systems prevents the lifting to an "indiscretization analogue" in the same manner, and thus they are not treated in this work.