Algorithm optimizes computational complexity in color-summed amplitudes and multiplet bases, highlighting scalability benefits.
A bstract The efficient computation of color-summed QCD amplitudes at high parton multiplicities remains a central challenge for precision collider predictions. Existing approaches using trace, color-flow, or adjoint bases suffer from non-orthogonality, which complicates the color algebra and scales poorly with multiplicity. In this work, we present an off-shell recursive framework for computing all-gluon tree-level amplitudes directly in orthogonal multiplet bases. Utilizing Wigner 6 j coefficients, we construct an algorithm that builds multiplet-projected off-shell currents from lower-point currents. By optimizing the recursion through partial summation and caching, we find that the computational complexity of calculating n -gluon color-summed squared amplitudes scales as O(17ⁿ) O 17 n . This demonstrates the potential competitiveness of multiplet bases for high-multiplicity processes.
No takes yet. Share an insight, caveat, or question.
Bolinder et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: