{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/efficient-calculation-of-crossing-symmetric","title":"Efficient Calculation of Crossing Symmetric BCJ Tree Numerators","arxiv_id":"2005.03638","date":"2020-05-07","proceeding":null,"authors":["Alex Edison","Fei Teng"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2005.03638v2","url_pdf":"https://arxiv.org/pdf/2005.03638v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"efficient-calculation-of-crossing-symmetric","repo_url":"https://gitlab.com/aedison/increasingtrees","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}