REVIEW 2 cited by
Recursion in multiplet bases for tree-level MHV gluon amplitudes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We investigate the construction of tree-level MHV gluon amplitudes in multiplet bases using BCFW recursion. The multiplet basis decomposition can either be obtained by decomposing results derived in (for example) the DDM basis or by formulating the recursion directly in the multiplet basis. We focus on the latter approach and show how to efficiently deal with the color structure appearing in the recursion. For illustration, we also explicitly calculate the four-, five- and six-gluon amplitudes.
Forward citations
Cited by 2 Pith papers
-
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.
-
All-gluon amplitudes with off-shell recursion in multiplet bases
A new off-shell recursion in orthogonal multiplet bases computes all-gluon tree-level color-summed squared amplitudes with estimated O(17^n) complexity, beating the factorial scaling of trace and color-flow bases.
Discussion (0). Sign in to comment.