🔢 mathematics

Degeneracy graph determinants and higher-dimensional Young diagrams

This paper proves a conjectured factorized formula for the determinant of an evaluation matrix associated with a degeneracy graph by establishing a block-triangular structure via graph analogues of Newton polynomials, thereby revealing that the determinant's exponents correspond to overlap volumes of higher-dimensional Young diagrams and enabling the explicit recursive inversion of the matrix.

Original authors: Sanjaye Ramgoolam, Michał Studziński

Published 2026-10-15

📖 6 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

In the vast landscape of modern physics, there is a deep and enduring puzzle about how the microscopic world connects to the macroscopic one. Specifically, scientists study systems where many tiny particles interact, trying to understand how the collective behavior of these particles gives rise to the smooth, continuous laws of gravity and space-time that we observe. A powerful tool for this investigation involves looking at "symmetries," which are rules that remain unchanged even when the system is rearranged. When physicists examine these symmetries in complex quantum systems, they often encounter a mathematical structure called a commutative algebra. Think of this as a set of rules for combining numbers or objects where the order in which you combine them does not matter. Within these structures, there are special building blocks known as projectors. These projectors act like filters, isolating specific states of a system so that researchers can study them individually. The challenge has long been to find a simple, reliable way to write down these filters using a standard set of ingredients, much like trying to describe a complex painting using only a limited palette of primary colors.

For years, researchers have known that for simple, single-layer systems, this task is manageable. However, when the systems become more complex, involving multiple layers of interactions, the mathematical tools that worked before began to fail. The question remained: is there a universal method to construct these filters for any level of complexity, and if so, what does the formula for their existence look like? This is the central problem addressed by a new study from physicists at Queen Mary University of London and the University of Gdańsk. They have now provided a complete proof for a long-standing guess about how these mathematical structures behave, showing that the filters can indeed be built from a specific set of simple ingredients, no matter how many layers of complexity are involved.

The researchers focused on a specific type of diagram, which they call a degeneracy graph. Imagine a tree-like structure where a single root splits into branches, and those branches split again and again. Each split represents a point where a system's possible states are divided into smaller, more specific groups. The scientists developed a way to map every possible path from the top of this tree to the very bottom tips, known as final nodes. They proposed that each of these paths corresponds to a unique mathematical expression, or monomial, built from the system's generators. The big question was whether these expressions were truly independent and sufficient to describe every possible state in the system. To answer this, the team had to prove that a specific matrix—a grid of numbers representing the values of these expressions—never collapses into a state where it loses information. In mathematical terms, they needed to show that the determinant of this matrix is never zero.

The team proved that this determinant is indeed non-zero, confirming that the proposed set of expressions forms a perfect basis for the system. Their proof relies on a clever rearrangement of the data, similar to how one might organize a messy room by grouping items into neat, non-overlapping piles. They introduced a new set of mathematical tools, which they call graph Newton polynomials, that act as a bridge between the messy original expressions and a cleaner, more organized form. By expanding the data in this new way, they showed that the complex matrix could be broken down into smaller, triangular blocks. This block-by-block structure allowed them to calculate the determinant by simply multiplying the values along the diagonal of these smaller blocks. This method works for any number of layers, proving that the basis property holds universally.

Beyond proving that the basis exists, the researchers uncovered a beautiful geometric meaning behind the numbers that appear in their formula. The formula for the determinant is a product of differences between the values associated with sibling branches in the tree. The power to which each difference is raised is not random; it corresponds to the volume of overlap between two higher-dimensional shapes attached to the sibling nodes. These shapes are generalizations of the familiar Young diagrams used in physics to describe how particles combine. In this new context, they appear as multi-dimensional stacks of cubes. The exponent in the formula is simply the number of cubes that sit in the intersection of the two stacks belonging to the siblings. This geometric insight transforms an abstract algebraic calculation into a tangible picture of overlapping volumes, linking the structure of the tree directly to the geometry of these high-dimensional shapes.

The implications of this work extend beyond pure mathematics. In the realm of quantum information, these projectors are essential for understanding how to measure and manipulate quantum states. For instance, in protocols designed to teleport information without sending the physical particle, the ability to precisely identify and isolate specific quantum sectors is crucial. The new formulas provide a direct way to construct the necessary measurement operators from a minimal set of commuting observables. This means that instead of needing a vast, unwieldy set of data to describe a quantum system, one can use a compact, efficient set of building blocks. The researchers also demonstrated how to reverse their process, providing a step-by-step recipe to express the projectors in terms of the simple monomial basis. This recursive inversion is vital for practical calculations, allowing physicists to move seamlessly between the abstract description of a system and the concrete operators needed to interact with it.

The study confirms that the relationship between these commuting observables and the projectors representing their spectral decompositions is robust and predictable. By establishing that the graph monomials form a basis for any number of layers, the authors have removed a significant barrier in the study of commutative semisimple algebras. Their work connects the combinatorial structure of the degeneracy graphs with the geometric properties of higher-dimensional Young diagrams, offering a unified view of these mathematical objects. The proof is rigorous and complete, relying on linear algebra and the properties of these graphs rather than unverified assumptions. It stands as a definitive answer to a question that has persisted in the study of symmetric group algebras and their applications in string theory and quantum information.

In the end, this research does more than just solve a specific equation; it provides a new lens through which to view the architecture of complex quantum systems. By showing that the determinant of the evaluation matrix is a product of powers of eigenvalue differences, with exponents determined by the overlap of these higher-dimensional shapes, the authors have revealed a hidden order in what might otherwise seem like a chaotic tangle of possibilities. This order suggests that even in the most intricate quantum systems, there are fundamental, geometric principles governing how information is structured and how it can be accessed. The ability to explicitly construct these projectors opens the door to more efficient algorithms for quantum computing and a deeper understanding of the microscopic origins of space-time. The work stands as a testament to the power of combining combinatorial insight with algebraic rigor to unlock the secrets of the quantum world.

Technical Summary: Degeneracy Graph Determinants and Higher-Dimensional Young Diagrams

Problem Statement
The paper addresses a fundamental question in the study of commutative associative semisimple (CASS) algebras, particularly those arising in the context of the AdS/CFT correspondence and the representation theory of symmetric groups. Specifically, it investigates the construction of a monomial basis for such algebras generated by a sequence of commuting operators $C_1, \dots, C_L$ .

In previous work [1], Kemp and Ramgoolam proposed that for a CASS algebra, the projectors $P_R$ forming a basis for the center can be expressed as polynomials in the generators. They constructed a specific set of "graph monomials" based on a "degeneracy graph," which records how the eigenspaces of $C_1$ are successively split by $C_2, \dots, C_L$ . While they proved these monomials form a basis for algebras with one or two layers of the degeneracy graph, the general case for an arbitrary number of layers remained a conjecture. The basis property is equivalent to the non-vanishing of the determinant of the evaluation matrix (the matrix of values of these monomials on the projector basis). Kemp and Ramgoolam conjectured a factorized formula for this determinant as a product of powers of differences of eigenvalues of sibling nodes, with exponents determined by truncated graphs.

Methodology
The authors prove the conjecture for degeneracy graphs with any number of layers using a linear-algebraic approach that generalizes the classical Newton-Vandermonde determinant proof.

Graph Newton Polynomials: The authors introduce "graph Newton polynomials" $N_T$ , which are related to the graph monomials $m_T$ by a unitriangular change of basis. While the evaluation matrix of the monomials ( $M$ ) is not generally triangular, the evaluation matrix of the Newton polynomials ( $N$ ) shares the same determinant.
Block Triangularization: The core of the proof involves expanding the rows of the Newton evaluation matrix corresponding to sibling nodes in the Newton basis of their eigenvalues. This expansion utilizes the divided differences of the eigenvalues.
Inductive Reduction: This expansion factorizes the matrix $N$ into a block diagonal matrix (composed of one-layer Newton-Vandermonde matrices for each set of siblings) and a block triangular matrix ( $N'$ ). The diagonal blocks of $N'$ correspond to "final-layer-excised graphs" ( $\Gamma[d]$ ), which are smaller degeneracy graphs obtained by removing the final layer and retaining only nodes with at least $d$ children.
Induction: By induction on the number of layers, the determinant of $N$ is shown to be the product of its diagonal entries. The diagonal entries themselves are products of eigenvalue differences.
Geometric Interpretation: The exponents in the determinant formula are identified as the overlap volumes of higher-dimensional Young diagrams attached to the nodes of the graph. These diagrams encode the admissible continuation data of the graph paths.

Key Contributions and Results

Proof of the Determinant Conjecture (Theorem 2.11): The paper provides a rigorous proof that the determinant of the graph monomial evaluation matrix factorizes as:
$\det M = \prod_{i=1}^L \prod_{u \in V_{i-1}} \prod_{p<q \in \text{Chi}(u)} (x^{(i)}_q - x^{(i)}_p)^{\text{Exp}(i,p,q)}$
where $x^{(i)}_p$ are the eigenvalues of the generators on the nodes, and $\text{Exp}(i,p,q)$ is the exponent determined by the graph structure.
Geometric Meaning of Exponents (Proposition 3.2): The authors demonstrate that the exponent $\text{Exp}(i,p,q)$ $Exp (i, p, q)$ for a pair of siblings $p, q$ $p, q$ at layer $i$ $i$ is exactly the volume of the intersection of their associated higher-dimensional Young diagrams ( $Y(p) \cap Y(q)$ $Y (p) \cap Y (q)$ ).
- For $L-i=1$ , these are intervals.
- For $L-i=2$ , they are ordinary Young diagrams (plane partitions).
- For $L-i \ge 3$ , they are higher-dimensional analogues (solid partitions).
Recursive Inversion of the Evaluation Matrix (Section 4.3): The block triangular structure derived in the proof allows for an explicit recursive inversion of the evaluation matrix. This provides a constructive algorithm to express the projectors $P_T$ in the monomial basis. The coefficients are polynomials in the eigenvalues divided by products of differences of sibling eigenvalues.
Generalization of Vandermonde Structure: The results show that the determinant of the graph monomial evaluation matrix is a product of Vandermonde determinants of eigenvalues of siblings, one for each set of siblings and each value of the continuation data. This holds even when the matrix is not triangular and the branching structure is non-uniform.

Significance and Claims
The paper claims to establish the basis property of the Kemp-Ramgoolam graph monomials for the full class of CASS algebras described by these degeneracy graphs, extending previous results limited to one and two layers.

Algebraic Connection: The work establishes a direct algebraic connection between commuting observables (generators) and the projectors representing their spectral decompositions.
Explicit Construction: It provides an explicit recursive procedure for computing the expansion of projectors in the monomial basis, which is crucial for applications in quantum information and the study of multi-matrix invariants.
Geometric Insight: By linking the algebraic exponents to the overlap volumes of higher-dimensional Young diagrams, the paper offers a geometric interpretation of the multiplicity of eigenvalue differences in the determinant.
Applicability: The authors note that while the primary motivation comes from the center of symmetric group algebras and the AdS/CFT correspondence (specifically distinguishing Young diagrams via Casimirs), the results apply to any CASS algebra with an ordered generating set. They suggest potential applications to Walled Brauer algebras and port-based teleportation protocols, where constructing projectors from commuting generators is required.

The paper does not propose new experimental setups or claim to solve open problems in black hole physics directly, but rather provides the necessary algebraic tools (basis construction and projector expansion) that underpin such physical inquiries. The proof is purely linear-algebraic and does not rely on Gröbner basis theory, though a connection is noted for future work.

More like this