⚛️ high-energy theory

Simple harmonic oscillators from non-semisimple walled Brauer algebras

This paper initiates a systematic study of the combinatorics of walled Brauer algebras in the non-semisimple regime by introducing restricted Bratteli diagrams to identify a stable region where representation theory data is governed by a universal partition function of an infinite tower of simple harmonic oscillators.

Original authors: Sanjaye Ramgoolam, Michał Studziński

Published 2026-07-09

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Sanjaye Ramgoolam, Michał Studziński

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 trying to organize a massive, complex dance troupe. You have two types of dancers: Fundamental Dancers (let's call them "Pros") and Anti-Fundamental Dancers (let's call them "Anti-Pros"). You want to arrange them in a line to perform a specific routine.

In the world of mathematics and physics, this "dance routine" is a Mixed Tensor Representation. The rules for how these dancers can pair up, swap places, or form groups are governed by a set of instructions called the Walled Brauer Algebra.

Here is the simple breakdown of what this paper does, using everyday analogies:

1. The Two Worlds: The "Easy" Way vs. The "Hard" Way

Imagine you have a huge stage.

The Large Stage (Large N): If your stage is massive (specifically, if the number of dancers is less than the stage size), everything is easy. The rules are simple, the dancers never bump into each other, and you can easily count how many different ways they can perform. Mathematicians call this the "semi-simple" regime. It's stable and predictable.
The Small Stage (Non-Semi-Simple): Now, imagine you shrink the stage. Suddenly, the dancers are too crowded. They start bumping into the walls and each other. The simple rules break down. Some dance moves that were possible on the big stage are now impossible or "forbidden." This is the "non-semi-simple" regime.

The Problem: When the stage is small, figuring out exactly how many valid dance routines exist becomes a nightmare. The old counting formulas stop working because they don't account for the "bumps" (the constraints of the small stage).

2. The New Tool: The "Restricted Bratteli Diagram" (RBD)

To solve this, the authors invented a new map called a Restricted Bratteli Diagram (RBD).

Think of this diagram as a flowchart of a video game level:

Green Nodes (The Winners): These represent dance routines that are still valid even on the small stage.
Red Nodes (The Forbidden Moves): These represent routines that hit a wall. They are "excluded" because they require more space than the small stage allows.

The paper's main trick is to trace the paths from the start of the game to the end. If a path hits a Red Node, that entire route is blocked. The authors realized that instead of looking at the whole messy game, you only need to look at the specific "Red Zones" and how they block the "Green Zones."

3. The Discovery: Stability in the Chaos

The authors found something surprising. Even though the stage is small and crowded, if you have enough dancers (a specific minimum number of Pros and Anti-Pros), the shape of the "Red Zone" stops changing.

They call this (m, n)-stability.

Analogy: Imagine you are packing a suitcase. If you have a tiny suitcase, the way you pack is chaotic. But if you have a medium-sized suitcase and you keep adding more clothes, the shape of the empty space (the "Red Zone") eventually stops changing. It becomes a fixed pattern that depends only on how much smaller the suitcase is, not on the total number of clothes.

This means that for a wide range of scenarios, the "messy" part of the math looks exactly the same. You don't need to recalculate everything from scratch every time you add a few more dancers.

4. The "Harmonic Oscillator" Connection (The Magic Formula)

Here is the most creative part of the paper. The authors counted the number of these "Red Nodes" (the forbidden moves) in the stable zone.

They discovered that the number of these forbidden moves follows a pattern that looks exactly like the math used to describe Simple Harmonic Oscillators.

The Analogy: Think of a child on a swing. The math describing how the swing moves back and forth is called a "harmonic oscillator."
The Surprise: The authors found that the number of "forbidden dance moves" in their crowded stage problem is calculated using a formula that is almost identical to the formula for an infinite tower of these swings.

It's like finding that the number of ways you can trip over your own shoelaces in a crowded room is governed by the same math that describes a pendulum swinging in a physics lab. It's a "universal" pattern that connects two very different-looking problems.

5. What They Actually Did (The Results)

The paper doesn't just talk about this; they did the heavy lifting:

They built the maps: They created the specific "Restricted Bratteli Diagrams" for small stages where the size is just 1, 2, 3, or 4 units smaller than the number of dancers.
They counted the blocks: They calculated exactly how many "Red Nodes" (forbidden moves) exist in these diagrams.
They proved the pattern: They showed that once you have enough dancers, the pattern of these blocks becomes stable and follows the "Harmonic Oscillator" formula.
They checked their work: They used computer code (Mathematica) to verify that their new formulas for counting the "Green" (valid) routines match up with the total space available.

Summary

In short, this paper takes a very difficult math problem about crowded dance routines (non-semi-simple algebras), invents a new map (RBD) to visualize the obstacles, discovers that the obstacles settle into a stable pattern, and realizes that the math for counting these obstacles is the same as the math for a swinging pendulum.

They provide the specific formulas to calculate the "valid" routines when the stage is small, which was previously a very hard problem to solve.

Technical Summary: Simple harmonic oscillators from non-semisimple walled Brauer algebras

Problem Statement
The paper addresses the representation theory of walled Brauer algebras, denoted $B_N(m, n)$ , which govern the combinatorics of mixed tensor representations of the unitary group $U(N)$ (specifically $V_N^{\otimes m} \otimes \bar{V}_N^{\otimes n}$ ). While the representation theory is well-understood in the "large $N$ " regime ( $N \ge m+n$ ), where the algebra is semi-simple and dimensions of irreducible representations are independent of $N$ , the non-semisimple regime ( $N < m+n$ ) presents significant challenges. In this regime, the algebra possesses a non-trivial kernel, and the dimensions of irreducible representations of the semi-simple quotient $\hat{B}_N(m, n)$ become dependent on $N$ . The specific problem tackled is the systematic calculation of these "modified dimensions" (dimensions reduced from their large $N$ values) and the combinatorial structure governing them when $N = m + n - l$ for small positive integers $l$ .

Methodology
The authors employ a combination of diagrammatic algebra, representation theory, and combinatorial analysis:

Kernel Analysis via Partial Transposition: The paper establishes a rigorous connection between the kernels of the representation maps for the symmetric group algebra $C(S_{m+n})$ and the walled Brauer algebra $B_N(m, n)$ . Using an operation of partial transposition ( $Pt_{m,n}$ ), they demonstrate that the kernels of the maps $\rho_{N, m+n}$ and $\rho_{N, m, n}$ are isomorphic. This allows the authors to leverage known results from symmetric group representation theory to analyze the non-semisimple Brauer algebra.
Restricted Bratteli Diagrams (RBD): To navigate the combinatorics of the non-semisimple regime, the authors introduce "Restricted Bratteli Diagrams" (RBD). Unlike standard Bratteli diagrams which track all paths, the RBD is a pruned subgraph containing:
- Green nodes: Representing admissible Brauer triples (satisfying the "finite $N$ constraint" $c_1(\gamma_+) + c_1(\gamma_-) \le N$ ) that have modified dimensions.
- Red nodes: Representing "excluded" triples (violating the constraint) that lie on paths leading to the green nodes.
- The RBD is constructed by keeping only the red nodes at depths $d > 0$ that connect to the modified green nodes at depth $d=0$ , along with necessary intermediate green nodes.
Dimension Calculation Algorithm: The modified dimension $\hat{d}_{m,n,N}(\gamma)$ is calculated as the stable large $N$ dimension $d_{m,n}(\gamma)$ minus a correction term $\delta_{m,n,N}(\gamma)$ . This correction corresponds to the number of paths in the full Bratteli diagram that pass through red nodes. The RBD allows for the efficient counting of these inadmissible paths using the stable dimension formulae as inputs.
Generating Functions and Oscillators: The authors analyze the counting of red and green nodes in the RBD within a specific stability region. They identify that the generating function for these counts matches the partition function of an infinite tower of simple harmonic oscillators.

Key Contributions and Results

Explicit Dimension Formulae for Small $l$ : The paper derives explicit formulae for the modified dimensions and the total dimension reduction $\Delta(m, n; N)$ for the cases $N = m + n - l$ with $l = 2, 3, 4$ . These results are presented for general $m, n$ (within the stable regime) and verified against independent calculations involving the dimensions of symmetric group representations.
Definition and Properties of RBD: The authors formally define the Restricted Bratteli Diagram and prove that for $N = m + n - l$ , the RBD has exactly $l$ layers (depths $0 \le d \le l-1$ ). They identify the unique "deepest" red node at depth $l-1$ .
$(m, n)$ -Stability (Degree-Stability): A central result is the identification of a stability region where the structure of the RBD becomes independent of the specific values of $m$ and $n$ . Specifically, for $m, n \ge (2l - 3)$ , the RBD depends only on $l$ . In this regime, the separation of Brauer triples into those with modified and unmodified dimensions is universal.
Connection to Harmonic Oscillators: In the $(m, n)$ -stable regime, the counting of red nodes (and consequently green nodes) as a function of depth is governed by a universal integer sequence (OEIS A000714). The generating function for this sequence, $Z_{univ}(x)$ , is shown to be closely related to the partition function of a 2D non-chiral free scalar field theory, but with additional factors of $\frac{1}{(1-x)(1-x^2)}$ . This reveals a structural link between the combinatorics of non-semisimple walled Brauer algebras and a system of simple harmonic oscillators.
Verification: The derived formulae for modified dimensions are cross-checked by verifying the identity of the total dimension of the commutant algebra $A^N_{m,n}$ , calculated both via the sum of modified squared dimensions and via the sum of symmetric group dimensions satisfying the finite $N$ constraint.

Significance and Claims
The paper claims to initiate a systematic study of the combinatorics of walled Brauer algebras in the non-semisimple regime, a area previously lacking general formulae. The significance lies in:

Bridging Regimes: Providing a method to process large $N$ data to calculate exact representation theory data in the non-semisimple regime via the RBD.
Universality: Demonstrating that despite the complexity of the non-semisimple regime, a stable combinatorial structure emerges for sufficiently large $m$ and $n$ , independent of the specific tensor ranks.
Novel Mathematical Connections: Establishing a previously unknown link between the representation theory of non-semisimple walled Brauer algebras and the partition functions of infinite towers of harmonic oscillators. The authors note that while the partition function resembles that of 2D scalar field theory (relevant in gauge-string duality), the specific form arising here is distinct and novel in this context.

The work is presented as a rigorous mathematical derivation with physical motivations drawn from AdS/CFT (brane-anti-brane systems, quarter-BPS sectors) and quantum information theory (port-based teleportation, mixed Schur-Weyl duality), but the core contribution is the combinatorial and algebraic characterization of the non-semisimple regime.