A new column-based Littlewood-Richardson algorithm decomposes products of SU(N) representations labeled by Young diagram pairs, valid simultaneously for all N.
The colour matrix at next-to-leading-colour accuracy for tree-level multi-parton processes
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We investigate the next-to-leading-colour (NLC) contributions to the colour matrix in the fundamental and the colour-flow decompositions for tree-level processes with all gluons, one quark pair and two quark pairs. By analytical examination of the colour factors, we find the non-zero elements in the colour matrix at NLC. At this colour order, together with the symmetry of the phase-space, it is reduced from factorial to polynomial the scaling of the contributing dual amplitudes as the number of partons participating in the scattering process is increased. This opens a path to an accurate tree-level matrix element generator of which all factorial complexity is removed, without resulting to Monte Carlo sampling over colour.
citation-role summary
citation-polarity summary
fields
hep-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.