🔢 mathematics

On the combinatorics of the refined 1-leg DT/PT correspondence

This paper provides a new proof of Bessenrodt's theorem relating reversed and skew plane partitions motivated by geometric DT/PT wallcrossing, while establishing new closed formulas for their weighted enumeration and interpreting these results as identities in Fock space via bosonic/fermionic formalism.

Original authors: Davide Accadia, Danilo Lewański, Sergej Monavari

Published 2026-04-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Davide Accadia, Danilo Lewański, Sergej Monavari

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are an architect designing a city made entirely of square blocks. In the world of mathematics, these block structures are called Young Diagrams (or partitions). They look like staircases or stepped pyramids.

This paper is about a fascinating game of "block rearranging" that connects two different ways of looking at these cities. The authors, Davide Accadia, Danilo Lewański, and Sergej Monavari, have discovered a new way to prove that two seemingly different counting problems are actually the same thing.

Here is the story of their discovery, broken down into simple concepts:

1. The Two Types of Cities: "Inside" vs. "Outside"

Imagine you have a specific city shape (a Young Diagram, let's call it $\lambda$ ).

The "Inside" View (Reverse Plane Partitions): Imagine you are filling the empty spaces inside your city's walls with blocks. You can only stack them if they get higher as you go right or down. It's like filling a bowl with sand.
The "Outside" View (Skew Plane Partitions): Now, imagine you are building a fortress around your city. You are placing blocks in the empty space surrounding your city, but again, following strict stacking rules.

For a long time, mathematicians knew there was a deep, magical connection between counting the ways to fill the "inside" and the ways to build the "outside." But the proof was like a complex magic trick: it worked, but it was hard to see why.

2. The "Tectonic Movement" (The Paper's Big Idea)

The authors introduce a new, visual way to prove this connection. They call it "Tectonic Movement."

Think of the empty space around your city as a collection of giant, floating tectonic plates (like the plates on Earth's crust).

The Problem: These plates are scattered around the city.
The Solution: The authors invent a rule to slide these plates. They push the plates North and West (up and to the left) based on how big the city is.
- If a plate is far to the right, it gets pushed left.
- If a plate is far down, it gets pushed up.

The Magic: When they slide all these plates according to this rule, something amazing happens:

Some plates slide perfectly into the space of an empty city (the "Outside" view of nothing).
The remaining pieces of the plates, where they overlap or get cut, magically form a perfect copy of the inside of the original city.

It's like taking a jigsaw puzzle of the "outside" world, sliding the pieces around, and realizing they perfectly reconstruct the "inside" world plus a blank canvas. This proves that counting the "outside" is exactly the same as counting the "inside" plus the "empty space."

3. The "Hook" Connection

In the world of these block cities, every square has a special "hook" attached to it.

An Internal Hook is a shape that starts inside the city and sticks out to the right and down.
An External Hook is a shape that starts outside the city and sticks up and left.

The authors found a new rule (Theorem 1.2) that says: "If you take a hook of a certain size from the outside of a city, you can turn it into a hook of the same size from the inside of a slightly larger city."

They call this "Hook-to-Strip."

Analogy: Imagine you have a long, L-shaped piece of wood (a hook) sticking out of your house. The authors show you can detach it, slide it into the house, and it fits perfectly as a new room, provided you expand the house just a tiny bit. This works for every single hook, proving a deep symmetry in the geometry.

4. Why Does This Matter? (The "Wall-Crossing" Story)

You might ask, "Why do we care about moving blocks around?"

This isn't just about puzzles. This math is the language of String Theory and Quantum Physics.

In physics, there are two different ways to calculate the behavior of tiny particles (called DT and PT theories).
For a long time, physicists had a formula (the "Wall-Crossing Formula") that said these two calculations give the same result, but the proof was very abstract and difficult.
This paper provides a combinatorial (block-counting) proof of that physics formula. It shows that the "magic" of the physics is actually just a clever game of sliding tectonic plates and rearranging hooks.

5. The "Fock Space" (The Musical Instrument)

Finally, the authors translate their block-moving game into the language of Fock Space.

Analogy: Imagine the block cities are musical notes.
The "Tectonic Movement" is like playing a specific chord on a piano.
The authors show that whether you play the chord on the "Inside" piano or the "Outside" piano, the resulting music (the mathematical formula) is identical. They use "Bosonic" and "Fermionic" operators (which are just fancy names for musical rules) to prove that the two sides of the equation are harmonizing perfectly.

Summary

In simple terms, this paper is a visual guide to a mathematical miracle.

It takes a complex problem about counting block structures.
It invents a new way to slide the blocks around ("Tectonic Movement") to show that the "outside" view is just a rearranged "inside" view.
It proves that this block-game is the secret key to understanding deep laws of the universe (String Theory).

The authors didn't just solve a puzzle; they built a bridge between the world of counting blocks and the world of quantum physics, showing that the universe might just be a giant, rearrangeable block city.

1. Problem Statement and Motivation

The paper addresses the combinatorial foundations underlying the Donaldson-Thomas (DT) and Pandharipande-Thomas (PT) correspondence for local curves.

Context: In enumerative geometry, the DT side (counting ideal sheaves/Hilbert schemes) and the PT side (counting stable pairs) of local curves are related by a wall-crossing formula.
Combinatorial Counterpart: It is known that the generating series for the DT side correspond to skew plane partitions, while the PT side corresponds to reversed plane partitions.
The Gap: While the geometric wall-crossing formula was established, the paper aims to provide a new, purely combinatorial proof of the refined bijection between these structures, specifically refining the relationship between internal hooks (associated with the partition) and external hooks (associated with the complement).
Goal: To prove a refined version of a theorem by Bessenrodt relating the generating series of reversed and skew plane partitions, and to establish new identities regarding the enumeration of hooks in Young diagrams.

2. Methodology

The authors employ a novel geometric-combinatorial approach centered on the subdivision of the plane and a specific transformation they term "tectonic movement."

A. Tectonic Movement and Thin Partitions

Subdivision: The authors subdivide the first quadrant $\mathbb{R}^2_{\geq 0}$ using the boundaries of a Young diagram $\lambda$ . This creates a grid of finite rectangles (called $\lambda$ -tiles) inside $\lambda$ and semi-infinite rectangles (called $\lambda$ -tectonic plates) outside $\lambda$ .
Thin Partitions: They introduce a class of partitions called thin partitions, defined by specific inequalities on the lengths of the tiles ( $x_i$ and $y_j$ ) ensuring that the sum of previous lengths is less than the current one.
The Map $\Theta_\lambda$ : They define a map $\Theta_\lambda$ that shifts each $\lambda$ -tectonic plate (external region) north-west. The shift amount is determined by the dimensions of the partition $\lambda$ located "above" and "to the left" of the plate.
Key Insight: For thin partitions, this movement creates a bijection where the shifted external regions cover the entire plane $\mathbb{R}^2_{\geq 0}$ (representing the empty partition's external hooks) plus a rotated copy of the original partition $\lambda$ (representing its internal hooks).

B. Hook-to-Strip Correspondence

The authors establish a direct bijection between internal hooks of a partition $\mu$ and external hooks of a smaller partition $\lambda$ .
This is achieved by viewing a hook as a "strip" that can be added to or removed from a partition while preserving the content set (the set of values $j-i$ for cells in the hook) and the hook type (arm and leg lengths).

C. Fock Space Formalism

The combinatorial results are reinterpreted in the language of infinite-dimensional representation theory (Fock space).
The authors utilize bosonic and fermionic operators (specifically free boson operators $\alpha_E$ ) acting on the semi-infinite wedge space. They show that the combinatorial bijections correspond to the action of these operators, specifically relating to the Murnaghan-Nakayama rule for removing strips.

3. Key Contributions and Results

A. New Proof of Bessenrodt's Theorem

The paper provides an alternative proof of Bessenrodt's theorem (Theorem 1.1), which states there is a bijection between the set of external hooks of a partition $\lambda$ ( $H'(\lambda)$ ) and the union of external hooks of the empty partition ( $H'(\emptyset)$ ) and internal hooks of $\lambda$ ( $H(\lambda)$ ).

Result: $H'(\lambda) \leftrightarrow H'(\emptyset) \cup H(\lambda)$ .
Innovation: Unlike Bessenrodt's original proof using Maya diagrams, this proof uses the tectonic movement of rectangles, making the preservation of hook types (arm and leg lengths) geometrically transparent.

B. The "Hook-to-Strip" Identity (Theorem 4.1)

The authors prove a new combinatorial identity relating sets of partitions with specific hook constraints.

Statement: For $d \geq \ell > 0$ $d \geq ℓ > 0$ , there is a bijection between:
- $S_{d,\ell}$ : Pairs $(\lambda, h)$ where $\lambda$ has size $d$ and $h$ is an internal hook of length $\ell$ .
- $S'_{d-\ell, \ell}$ : Pairs $(\lambda', h')$ where $\lambda'$ has size $d-\ell$ and $h'$ is an external hook of length $\ell$ .
Property: This bijection preserves the positions of the hand and foot of the hooks, and consequently, the content sets and hook types.

C. Generating Series Identities

By applying the bijections to generating functions, the authors derive several closed formulas:

Refined Bessenrodt Identity:
$\prod_{\square \in H'(\lambda)} \frac{1}{1 - x^{a(\square)+1} y^{\ell(\square)}} = \left( \prod_{\square \in H'(\emptyset)} \frac{1}{1 - x^{a(\square)+1} y^{\ell(\square)}} \right) \left( \prod_{\square \in H(\lambda)} \frac{1}{1 - x^{a(\square)+1} y^{\ell(\square)}} \right)$
This refines Sagan's theorem by distinguishing arm ( $a$ ) and leg ( $\ell$ ) lengths rather than just total hook length.
Dual Identity: A new identity relating the generating series of internal and external hooks of different partitions (Corollary 4.5).
Proposition 1.6: A combined identity linking the generating series of all partitions of size $d$ to the empty partition and the refined hook counts.

D. Fock Space Interpretation

The paper concludes by showing that the combinatorial bijection (Theorem 4.1) is equivalent to an identity involving q-twisted free boson operators in the Fock space:
$\sum_{\lambda \in P_d} \sum_{\mu \in P_{d-\ell}} \langle \mu | \alpha^q_\ell | \lambda \rangle = \sum_{\lambda \in P_d} \sum_{\mu \in P_{d-\ell}} \langle \lambda | \alpha^q_{-\ell} | \mu \rangle$
This connects the combinatorial "strip" removal/addition to the algebraic action of bosonic operators.

4. Significance

Geometric-Combinatorial Bridge: The paper successfully translates a deep geometric result (the DT/PT wall-crossing formula for local curves) into a transparent combinatorial mechanism (tectonic movement).
Refinement: It moves beyond unrefined hook lengths to refined counts involving arm and leg lengths, which are crucial for the refined topological vertex and refined Donaldson-Thomas invariants.
New Tools: The introduction of "tectonic movement" and the subdivision of the plane into tiles/plates offers a new geometric tool for analyzing Young diagrams and plane partitions.
Unification: It unifies results by Bessenrodt, Gansner, and Sagan under a single framework and extends them to a "dual" setting involving different partitions, providing a more complete picture of the combinatorics of hooks.

In summary, the paper offers a rigorous, geometrically intuitive proof of refined partition identities that serve as the combinatorial backbone for modern enumerative geometry problems involving Calabi-Yau threefolds and local curves.