- Open Access
Inverse Cachazo-He-Yuan integrand construction from factorization channels with exact integer constraint propagation
Phys. Rev. D 113, 105006 – Published 12 May, 2026
DOI: https://doi.org/10.1103/nczg-mn96
Abstract
In the Cachazo-He-Yuan (CHY) representation, many tree-level scattering amplitudes are written as integrals localized by the scattering equations, where the CHY integrand encodes the theory and must reproduce the physical factorization pattern of Mandelstam singularities. The inverse CHY problem therefore asks for a rational integrand whose physical poles match a prescribed set of factorization channels, a task that becomes rapidly combinatorial at higher multiplicity. We present an algorithmic approach that makes the subset structure of pole data explicit by assigning each particle subset a generalized pole degree , realized as a signed internal-edge count in a colored integrand graph. Additivity under integrand multiplication and an elementary face recursion on the subset lattice imply that all higher-channel are linear functions of the two-particle integers , so the inverse step becomes a mixed-integer linear feasibility problem. The same subset lattice provides a fixed computation graph for exact constraint satisfaction: pole requirements and recursion identities are treated as hard constraints, updates are restricted to those that preserve feasibility, and whenever a proposed change would enter a fixed node its constraint residual is rerouted and redistributed through unfixed degrees of freedom so that all constraints remain satisfied throughout. After a factorial rescaling, every local propagation update is purely integral, keeping the entire procedure exact in integer arithmetic and avoiding a posteriori reconstruction from numerical evaluations. Since physical tree-level amplitudes must contain only simple factorization poles as dictated by unitarity and locality, we further organize generalized integrands by an -regular grading under multiplication, where degree-zero factors act as Möbius-invariant insertions admitting a decomposition into products of four-point cross ratios, which guides efficient higher-order pole reduction. We illustrate the construction at six and eight points, including pole selection and higher-order pole reduction.
Physics Subject Headings (PhySH)
Article Text
References (65)
- F. Cachazo, S. He, and E. Y. Yuan, Scattering equations and kawai-llewellen-tye orthogonality, Phys. Rev. D 90, 065001 (2014).
- F. Cachazo, S. He, and E. Y. Yuan, Scattering of massless particles: Scalars, gluons and gravitons, J. High Energy Phys. 07 (2014) 033.
- F. Cachazo, S. He, and E. Y. Yuan, Scattering of massless particles in arbitrary dimensions, Phys. Rev. Lett. 113, 171601 (2014).
- C. Baadsgaard, N. E. J. Bjerrum-Bohr, J. L. Bourjaily, and P. H. Damgaard, Integration rules for scattering equations, J. High Energy Phys. 09 (2015) 129.
- C. Baadsgaard, N. E. J. Bjerrum-Bohr, J. L. Bourjaily, and P. H. Damgaard, Scattering equations and feynman diagrams, J. High Energy Phys. 09 (2015) 136.
- F. Cachazo and H. Gomez, Computation of Contour Integrals on , J. High Energy Phys. 04 (2016) 108.
- C. Cardona, B. Feng, H. Gomez, and R. Huang, Cross-ratio identities and higher-order poles of CHY-integrand, J. High Energy Phys. 09 (2016) 133.
- R. Huang, B. Feng, M.-x. Luo, and C.-J. Zhu, Feynman rules of higher-order poles in CHY construction, J. High Energy Phys. 06 (2016) 013.
- K. Zhou, Analytic expressions of amplitudes by the cross-ratio identity method, Eur. Phys. J. C 77, 388 (2017).
- R. Huang, F. Teng, and B. Feng, Permutation in the CHY formulation, Nucl. Phys. B932, 323 (2018).
- A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization (John Wiley & Sons, Chichester, 1998).
- L. A. Wolsey, Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization (John Wiley & Sons, New York, 1998).
- G. De Laurentis, Analytical amplitudes from numerical solutions of the scattering equations, J. High Energy Phys. 02 (2020) 194.
- T. Peraro, Scattering amplitudes over finite fields and multivariate functional reconstruction, J. High Energy Phys. 12 (2016) 030.
- T. Peraro, FiniteFlow: Multivariate functional reconstruction using finite fields and dataflow graphs, J. High Energy Phys. 07 (2019) 031.
- J. Klappert and F. Lange, Reconstructing rational functions with FireFly, Comput. Phys. Commun. 247, 106951 (2020).
- H. R. P. Ferguson, D. H. Bailey, and S. Arno, Analysis of PSLQ, an integer relation finding algorithm, Math. Comput. 68, 351 (1999).
- S. Laporta, High-precision calculation of multiloop feynman integrals by difference equations, Int. J. Mod. Phys. A 15, 5087 (2000).
- F. Cachazo, S. He, and E. Y. Yuan, Scattering equations and matrices: From Einstein to Yang-Mills, DBI and NLSM, J. High Energy Phys. 07 (2015) 149.
- L. Dolan and P. Goddard, The polynomial form of the scattering equations, J. High Energy Phys. 07 (2014) 029.
- Y. Zhang, On the new factorizations of Yang-Mills amplitudes, J. High Energy Phys. 02 (2025) 074.
- Y. Zhang, New factorizations of Yang-Mills amplitudes, Phys. Rev. D 111, 085004 (2025).
- S. He and E. Y. Yuan, One-loop scattering equations and amplitudes from forward limit, Phys. Rev. D 92, 105004 (2015).
- L. Mason and D. Skinner, Ambitwistor strings and the scattering equations, J. High Energy Phys. 07 (2014) 048.
- Y. Geyer, L. Mason, R. Monteiro, and P. Tourkine, Loop integrands for scattering amplitudes from the riemann sphere, Phys. Rev. Lett. 115, 121603 (2015).
- B. Feng, CHY-construction of planar loop integrands of cubic scalar theory, J. High Energy Phys. 05 (2016) 061.
- B. Feng and C. Hu, One-loop CHY-integrand of bi-adjoint scalar theory, J. High Energy Phys. 02 (2020) 187.
- X. Gao, S. He, and Y. Zhang, Labelled tree graphs, feynman diagrams and disk integrals, J. High Energy Phys. 11 (2017) 144.
- F. Cachazo, N. Early, A. Guevara, and S. Mizera, Scattering equations: From projective spaces to tropical grassmannians, J. High Energy Phys. 06 (2019) 039.
- N. Arkani-Hamed, Y. Bai, and T. Lam, Positive geometries and canonical forms, J. High Energy Phys. 11 (2017) 039.
- S. Mizera, Combinatorics and topology of Kawai-Lewellen-Tye relations, J. High Energy Phys. 08 (2017) 097.
- S. Mizera, Scattering amplitudes from intersection theory, Phys. Rev. Lett. 120, 141602 (2018).
- S. Mizera, Aspects of Scattering Amplitudes and Moduli Space Localization (Springer, Cham, 2020).
- F. Brown and C. Dupont, Single-valued integration and superstring amplitudes in genus zero, Commun. Math. Phys. 382, 815 (2021).
- Y.-H. He, Machine-learning the string landscape, Phys. Lett. B 774, 564 (2017).
- Y.-H. He, The Calabi-Yau Landscape: From Geometry, to Physics, to Machine Learning, Lecture Notes in Mathematics, Vol. 2293 (Springer, Cham, 2021).
- A. Ashmore, Y. He, and B. A. Ovrut, Machine learning Calabi–Yau metrics, Fortschr. Phys. 68, 2000068 (2020).
- E. Bothmann, T. Janssen, M. Knobbe, T. Schmale, and S. Schumann, Exploring phase space with neural importance sampling, SciPost Phys. 8, 069 (2020).
- R. Winterhalder, V. Magerya, E. Villa, S. P. Jones, M. Kerner, A. Butter, G. Heinrich, and T. Plehn, Targeting multi-loop integrals with neural networks, SciPost Phys. 12, 129 (2022).
- A. Dersy, M. D. Schwartz, and X. Zhang, Simplifying polylogarithms with machine learning, Int. J. Data Sci. Math. Sci. 1, 135 (2024).
- T. Cai, G. W. Merz, F. Charton, N. Nolte, M. Wilhelm, K. Cranmer, and L. J. Dixon, Transforming the bootstrap: Using transformers to compute scattering amplitudes in planar Super Yang-Mills theory, Mach. Learn. Sci. Technol. 5, 035073 (2024).
- A. Alnuqaydan, S. Gleyzer, and H. Prosper, SYMBA: Symbolic computation of squared amplitudes in high energy physics with machine learning, Mach. Learn. Sci. Technol. 4, 015007 (2023).
- G. Carleo, I. Cirac, K. Cranmer, L. Daudet, M. Schuld, N. Tishby, L. Vogt-Maranto, and L. Zdeborová, Machine learning and the physical sciences, Rev. Mod. Phys. 91, 045002 (2019).
- A. von Manteuffel and R. M. Schabinger, A novel approach to integration by parts reduction, Phys. Lett. B 744, 101 (2015).
- S. Ebli, M. Defferrard, and G. Spreemann, Simplicial neural networks, arXiv:2010.03633.
- C. Bodnar, F. Frasca, Y. G. Wang, N. Otter, G. F. Montúfar, P. Liò, and M. M. Bronstein, Weisfeiler and Lehman go topological: Message passing simplicial networks, in Proceedings of the 38th International Conference on Machine Learning (ICML), Proceedings of Machine Learning Research Vol. 139 (PMLR, 2021), pp. 1026–1037.
- C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe, Weisfeiler and Leman go neural: Higher-order graph neural networks, arXiv:1810.02244.
- F. Cachazo, S. He, and E. Y. Yuan, Einstein-Yang-Mills scattering amplitudes from scattering equations, J. High Energy Phys. 01 (2015) 121.
- T. Adamo, E. Casali, and D. Skinner, Ambitwistor strings and the scattering equations at one loop, J. High Energy Phys. 04 (2014) 104.
- B. Feng and Y. Zhang, Note on the labelled tree graphs, J. High Energy Phys. 12 (2020) 096.
- F. Cachazo, K. Yeats, and S. Yusim, Compatible cycles and CHY integrals, J. High Energy Phys. 12 (2019) 105.
- C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Courier Corporation, New York, 1998).
- B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 5th ed., Algorithms and Combinatorics (Springer, New York, 2012).
- J. E. Mitchell, Encyclopedia of Optimization (Springer, Boston, MA, 2008).
- R. E. Bixby, A Brief History of Linear and Mixed-Integer Programming Computation, Documenta Mathematica series, 10.4171/dms/6/16 (2012).
- Y. Bengio, A. Lodi, and A. Prouvost, Machine learning for combinatorial optimization: A methodological tour d’horizon, arXiv:1811.06128.
- M. Gasse, D. Chételat, N. Ferroni, L. Charlin, and A. Lodi, Exact combinatorial optimization with graph convolutional neural networks, arXiv:1906.01629.
- Wolfram Research, Inc., Mathematica, version 14.2 [software], https://www.wolfram.com/mathematica/ (2024).
- P. Virtanen et al. (SciPy 1.0 Contributors), SciPy 1.0: Fundamental algorithms for scientific computing in python, Nat. Methods 17, 261 (2020).
- Q. Huangfu and J. A. J. Hall, Parallelizing the dual revised simplex method, Math. Program. Comput. 10, 119 (2018).
- S. Diamond and S. Boyd, CVXPY: A python-embedded modeling language for convex optimization, J. Mach. Learn. Res. 17, 1 (2016).
- S. Mitchell, PuLP: A linear programming toolkit for python [software], https://coin-or.github.io/pulp/ (2011).
- B. Feng, C. Hu, and Y. Zhang, Note on solutions of scattering equations, Phys. Rev. D 105, 036015 (2022).
- J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (Springer, New York, 1976).
- R. Diestel, Graph Theory, 5th ed., Graduate Texts in Mathematics (Springer, New York, 2017), Vol. 173.