arXiv:2610.20368
Degeneracy graph determinants and higher-dimensional Young diagrams
Sanjaye Ramgoolam, Michał Studziński
Abstract
Kemp and Ramgoolam proposed a basis of monomials for a commutative semisimple algebra with generators \(C_1,\ldots, C_L\), constructed from a degeneracy graph which records how the eigenspaces of \( C_1\) are successively split by \( C_2,\ldots, C_L\). They showed that the basis property is equivalent to the non-vanishing of the determinant of the matrix of values of these monomials on the projector basis, and conjectured a factorised formula for this determinant, as a product of powers of eigenvalue differences. We prove this formula for any number of generators. The proof uses graph analogues of Newton polynomials. Their evaluation matrix is not triangular in general, but expanding the rows of the children of each node of the penultimate layer in a Newton basis of their eigenvalues makes it block triangular, with diagonal blocks given by smaller degeneracy graphs in which the final layer is removed. The formula then follows by induction on the number of layers. We show that the exponents in the determinant are overlap volumes of higher-dimensional Young diagrams attached to the nodes of the graph: intervals, ordinary Young diagrams, plane partitions and their higher analogues. Finally, the block triangular structure gives an explicit recursive inversion of the evaluation matrix, expressing the projectors in the monomial basis.
AI Summary
The paper addresses how to construct a monomial basis and recover primitive projectors in a finite-dimensional commutative semisimple algebra with ordered generators $C_1,\ldots,C_L$. A degeneracy graph records how successive generators split joint eigenspaces. Earlier work proposed graph-dependent monomials and conjectured a factorisation of their evaluation determinant, with the basis property established for one and two layers. The determinant formula is proved for arbitrary $L$: $\det M=\prod_{i,u}\prod_{p<q\in\mathrm{Ch}_i(u)}(x_q^{(i)}-x_p^{(i)})^{|\mathcal Y(p)\cap\mathcal Y(q)|}$. Here sibling nodes have distinct eigenvalues, and $\mathcal Y(p)$ is a higher-dimensional Young diagram encoding admissible continuations below $p$. Thus the determinant is nonzero and the proposed monomials form a basis. The exponents are overlap volumes: intervals give $\min(n_p,n_q)$ one layer before the leaves, followed by ordinary Young diagrams, plane partitions and higher analogues at greater depths. The proof constructs graph Newton polynomials related to the monomials by a unitriangular transformation. Although their evaluation matrix need not be triangular, Newton expansion among sibling rows makes it block triangular, with diagonal blocks associated with graphs having one fewer layer. Induction establishes the determinant, while divided differences and recursive block back-substitution give explicit projector expansions. Quantum-information connections include Schur–Weyl sector projectors and spectral-moment observables, rather than new measurement protocols. Relations to Gröbner-basis constructions, concrete Brauer and walled Brauer applications, and off-diagonal matrix-unit constructions remain open directions. Non-semisimple extensions require information beyond joint eigenvalues.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 53 pages,