Pith. sign in

REVIEW 2 cited by

QCD multiplet bases with arbitrary parton ordering

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1809.05002 v1 pith:XMUEIINO submitted 2018-09-13 hep-ph hep-th

Malin Sjodahl , Johan Thorén This is my paper
classification hep-phhep-th
keywords basesmultipletcoefficientscolorconstructingwigneralgorithmapplied
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We develop an algorithm for recursively constructing orthogonal multiplet bases for the color space of QCD, for any order of partons and any Nc. This recipe is then applied for explicitly constructing some of these bases. Using the bases, a corresponding set of Wigner 6j coefficients are calculated. The Wigner coefficients offer a method of using multiplet bases without resorting to the explicit expressions of the basis vectors, which lead to a significant speed-up compared to other methods of treating full color structure.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An $N$-independent tensor decomposition for SU($N$)

    hep-ph 2025-07 conditional novelty 7.0 of 10

    A new column-based Littlewood-Richardson algorithm decomposes products of SU(N) representations labeled by Young diagram pairs, valid simultaneously for all N.

  2. All-gluon amplitudes with off-shell recursion in multiplet bases

    hep-ph 2025-07 conditional novelty 6.0 of 10

    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.

Pith tools