Papers › Efficient Calculation of Crossing Symmetric BCJ Tree Numerators
Efficient Calculation of Crossing Symmetric BCJ Tree Numerators
Alex Edison, Fei Teng
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we propose an improved method for directly calculating double-copy-compatible tree numerators in (super-)Yang-Mills and Yang-Mills-scalar theories. Our new scheme gets rid of any explicit dependence on reference orderings, restoring a form of crossing symmetry to the numerators. This in turn improves the computational efficiency of the algorithm, allowing us to go well beyond the number of external particles accessible with the reference order based methods. Motivated by a parallel study of one-loop BCJ numerators from forward limits, we explore the generalization to include a pair of fermions. To improve the accessiblity of the new algorithm, we provide a Mathematica package that implements the numerator construction. The structure of the computation also provides for a straightforward introduction of minimally-coupled massive particles potentially useful for future computations in both classical and quantum gravity.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections