A new column-based Littlewood-Richardson algorithm decomposes products of SU(N) representations labeled by Young diagram pairs, valid simultaneously for all N.
Compact Hermitian Young Projection Operators
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this paper, we describe a compact and practical algorithm to construct Hermitian Young projection operators for irreducible representations of the special unitary group SU(N), and discuss why ordinary Young projection operators are unsuitable for physics applications. The proof of this construction algorithm uses the iterative method described by Keppeler and Sj\"odahl. We further show that Hermitian Young projection operators share desirable properties with Young tableaux, namely a nested hierarchy when "adding a particle". We end by exhibiting the enormous advantage of the Hermitian Young projection operators constructed in this paper over those given by Keppeler and Sj\"odahl.
citation-role summary
method 1
citation-polarity summary
fields
hep-ph 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
An $N$-independent tensor decomposition for SU($N$)
A new column-based Littlewood-Richardson algorithm decomposes products of SU(N) representations labeled by Young diagram pairs, valid simultaneously for all N.