Recognition: no theorem link
An Algorithm for the Symbolic Reduction of Multi-loop Feynman Integrals via Generating Functions
Pith reviewed 2026-05-12 04:17 UTC · model grok-4.3
The pith
Reformulating integration-by-parts identities as differential equations for generating functions yields an iterative algorithm for symbolic reduction of multi-loop Feynman integrals.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the reduction problem can be studied in a non-commutative algebra of differential operators rather than only through relations among individual integrals. This viewpoint leads to an iterative algorithm that generates candidate equations, extracts symbolic reduction rules, updates the active rule set, and tests completeness on the lattice of integral indices. The method is illustrated with the sunset topology, planar and non-planar massless double-box topologies, representative subsectors, and a degenerate example in which the top sector contains no master-integr
What carries the argument
Sector-wise generating functions whose differential equations encode IBP identities; the iterative algorithm that generates candidate equations, extracts rules, and tests completeness on the lattice of integral indices.
If this is right
- Symbolic reduction rules can be derived automatically for topologies such as the sunset and massless double-box without case-by-case manual work.
- Completeness of any reduction can be verified systematically by checking the lattice of integral indices.
- The same framework handles planar, non-planar, and degenerate topologies where the top sector may have no master integral.
- Descendant equations and reduction criteria are organized together inside one algebraic structure.
Where Pith is reading between the lines
- The differential-operator view could be extended to classify families of topologies by the structure of their generating-function algebras.
- Implementation of the iterative procedure could be combined with existing reduction tools to lower the manual overhead in multi-loop calculations.
- The approach may generalize to other integral relations that can be expressed as differential equations on generating functions.
Load-bearing premise
That rewriting IBP identities as differential equations for sector-wise generating functions captures all necessary relations without missing independent identities or requiring additional manual input for the topologies examined.
What would settle it
Apply the algorithm to a topology with a known complete reduction obtained by another method and check whether it recovers exactly the same rules and master integrals without omissions or false claims of completeness.
read the original abstract
We develop a generating-function formulation for the symbolic reduction of multi-loop Feynman integrals. In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the reduction problem can be studied in a non-commutative algebra of differential operators rather than only through relations among individual integrals. This viewpoint leads to an iterative algorithm that generates candidate equations, extracts symbolic reduction rules, updates the active rule set, and tests completeness on the lattice of integral indices. We illustrate the method with the sunset topology, planar and non-planar massless double-box topologies, representative subsectors, and a degenerate example in which the top sector contains no master integral. Together, these examples show how symbolic reduction rules, descendant equations, and completeness criteria can be organized within a single algebraic framework.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a generating-function formulation for symbolically reducing multi-loop Feynman integrals. IBP identities are rewritten as differential equations for sector-wise generating functions, shifting the problem into a non-commutative algebra of differential operators. This yields an iterative algorithm that generates candidate equations, extracts symbolic reduction rules, updates the active rule set, and tests completeness on the lattice of integral indices. The method is illustrated on the sunset topology, planar and non-planar massless double boxes, representative subsectors, and a degenerate no-master top sector.
Significance. If the completeness and termination properties hold in general, the framework would provide a systematic algebraic route to reduction rules that organizes candidate equations, descendant relations, and lattice checks in one setting, potentially reducing manual case-by-case IBP work for complex topologies. The paper earns credit for covering both standard and degenerate cases (including a top sector with no masters) within the same formalism and for avoiding fitted parameters or self-referential predictions.
major comments (2)
- [Abstract and § on the iterative algorithm] Abstract and algorithm description: the central claim that the iterative process 'tests completeness on the lattice of integral indices' is load-bearing, yet the manuscript provides no explicit demonstration that candidate-equation generation from the non-commutative DE algebra exhausts all independent IBP relations. It is not shown that the extracted rules reproduce known master-integral counts for the illustrated topologies or that iteration terminates without gaps when the operator set or generating-function ansatz is incomplete.
- [Examples section] Examples section: while the sunset, planar/non-planar double-box, subsector, and degenerate cases are presented as successful, there is no quantitative verification (e.g., comparison of extracted rule counts or reduction outcomes against standard IBP results) that the algorithm has captured every necessary relation without requiring topology-specific manual augmentation.
minor comments (1)
- [Notation and setup] The notation for sector-wise generating functions and the precise form of the differential operators could be introduced with an explicit low-order example equation to improve readability for readers unfamiliar with the non-commutative algebra.
Simulated Author's Rebuttal
We thank the referee for the constructive report and the recognition of the framework's potential. We address the two major comments below, agreeing that additional explicit verifications are warranted and will be incorporated in the revision.
read point-by-point responses
-
Referee: [Abstract and § on the iterative algorithm] Abstract and algorithm description: the central claim that the iterative process 'tests completeness on the lattice of integral indices' is load-bearing, yet the manuscript provides no explicit demonstration that candidate-equation generation from the non-commutative DE algebra exhausts all independent IBP relations. It is not shown that the extracted rules reproduce known master-integral counts for the illustrated topologies or that iteration terminates without gaps when the operator set or generating-function ansatz is incomplete.
Authors: We agree that the manuscript would be strengthened by explicit verification. In the revised version we will add, for each illustrated topology, a direct comparison of the number of master integrals obtained from the generated rules against the counts established in the literature (e.g., via LiteRed or FIRE for the sunset and double-box families). The lattice-completeness test is performed by confirming that every integral index in the sector reduces to the identified masters under the extracted rules; we will expand the algorithm section to describe this check step-by-step and to state explicitly that a general proof of exhaustiveness for arbitrary topologies lies outside the present scope. revision: yes
-
Referee: [Examples section] Examples section: while the sunset, planar/non-planar double-box, subsector, and degenerate cases are presented as successful, there is no quantitative verification (e.g., comparison of extracted rule counts or reduction outcomes against standard IBP results) that the algorithm has captured every necessary relation without requiring topology-specific manual augmentation.
Authors: We will augment the examples section with quantitative tables listing (i) the number of candidate equations generated, (ii) the number of independent reduction rules retained after the iterative update, and (iii) the final master-integral count, together with a side-by-side comparison to results obtained from conventional IBP packages. For the degenerate top-sector example we will explicitly verify that the algorithm terminates with an empty master set. These additions will confirm that no manual augmentation was required for the reported cases. revision: yes
- A general, topology-independent proof that the candidate-generation procedure always exhausts the full space of IBP relations and that iteration terminates without gaps remains an open theoretical question and is not claimed or provided in the manuscript.
Circularity Check
No significant circularity in the generating-function reformulation of IBP reduction
full rationale
The paper presents a self-contained algorithmic reformulation that rewrites standard IBP identities as differential equations acting on sector-wise generating functions, then iterates to extract reduction rules and test completeness on the index lattice. This is illustrated directly on concrete topologies (sunset, double boxes, subsectors) without any fitted parameters, self-referential predictions, or load-bearing self-citations that reduce the central claim to its own inputs by construction. The derivation chain remains independent of the target results and does not invoke uniqueness theorems or ansatzes imported from the authors' prior work.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Integration-by-parts identities can be rewritten as differential equations for sector-wise generating functions.
Reference graph
Works this paper leans on
-
[1]
Johannes M. Henn. Multiloop integrals in dimensional regularization made simple. Phys. Rev. Lett., 110:251601, 2013. arXiv:1304.1806, doi:10.1103/PhysRevLett.110.251601
-
[2]
Christoph Meyer. Evaluating multi-loop feynman integrals using differential equations: automatizing the transformation to a canonical basis. PoS, LL2016:028, 2016. doi:10.22323/1.260.0028
-
[3]
Algorithmic transformation of multi-loop master integrals to a canonical basis with canonica
Christoph Meyer. Algorithmic transformation of multi-loop master integrals to a canonical basis with canonica. Comput. Phys. Commun. , 222:295–312, 2018. arXiv:1705.06252, doi:10.1016/j.cpc.2017.09.014
-
[4]
Amflow: a mathematica package for feynman integrals computation via auxiliary mass flow
Xiao Liu and Yan-Qing Ma. Amflow: a mathematica package for feynman integrals computation via auxiliary mass flow. Comput. Phys. Commun. , 283:108565, 2023. arXiv:2201.11669, doi:10.1016/j.cpc.2022.108565
-
[5]
Complete reduction of integrals in two-loop five-light-parton scattering amplitudes
Xin Guan, Xiao Liu, and Yan-Qing Ma. Complete reduction of integrals in two-loop five-light-parton scattering amplitudes. Chin. Phys. C , 44:093106, 2020. arXiv:1912.09294, doi:10.1088/1674-1137/44/9/093106
-
[6]
All two-loop feynman integrals for five-point one-mass scattering
Samuel Abreu, Dmitry Chicherin, Harald Ita, Ben Page, Vasily Sotnikov, Wladimir Tschernow, and Simone Zoia. All two-loop feynman integrals for five-point one-mass scattering. Phys. Rev. Lett. , 132:141601, 2024. arXiv:2306.15431, doi:10.1103/PhysRevLett.132.141601
-
[7]
Planar six-point Feynman integrals for four-dimensional gauge theories
Samuel Abreu, Pier Francesco Monni, Ben Page, and Johann Usovitsch. Planar six-point Feynman integrals for four-dimensional gauge theories. JHEP, 06:112, 2025. arXiv:2412.19884, doi:10.1007/JHEP06(2025)112
-
[8]
Complete Function Space for Planar Two-Loop Six-Particle Scattering Amplitudes
Johannes Henn, Antonela Matijašić, Julian Miczajka, Tiziano Peraro, Yingxuan Xu, and Yang Zhang. Complete Function Space for Planar Two-Loop Six-Particle Scattering Amplitudes. Phys. Rev. Lett. , 135(3):031601, 2025. arXiv:2501.01847, doi:10.1103/zhzd-tj9p. – 62 –
-
[9]
An analytic computation of three-loop five-point feynman integrals
Yuanche Liu, Antonela Matijašić, Julian Miczajka, Yingxuan Xu, Yongqun Xu, and Yang Zhang. An analytic computation of three-loop five-point feynman integrals. Phys. Rev. D , 112:016021, 2025. arXiv:2411.18697, doi:10.1103/qrk2-cym5
-
[10]
Complete computation of all three-loop five-point massless planar integrals
Dmitry Chicherin, Yu Wu, Zihao Wu, Yongqun Xu, Shun-Qing Zhang, and Yang Zhang. Complete computation of all three-loop five-point massless planar integrals. 12 2025. arXiv:2512.17330
-
[11]
F. V. Tkachov. A theorem on analytical calculability of four loop renormalization group functions. Phys. Lett. B , 100:65–68, 1981. doi:10.1016/0370-2693(81)90288-4
-
[12]
K. G. Chetyrkin and F. V. Tkachov. Integration by parts: The algorithm to calculate beta functions in 4 loops. Nucl. Phys. B , 192:159–204, 1981. doi:10.1016/0550-3213(81)90199-1
-
[13]
High-precision calculation of multiloop feynman integrals by difference equations
Stefano Laporta. High-precision calculation of multiloop feynman integrals by difference equations. Int. J. Mod. Phys. A , 15:5087–5159, 2000. arXiv:hep-ph/0102033, doi:10.1142/S0217751X00002159
-
[14]
O. V. Tarasov. Connection between feynman integrals having different values of the space-time dimension. Phys. Rev. D , 54:6479–6490, 1996. arXiv:hep-th/9606018, doi:10.1103/PhysRevD.54.6479
-
[15]
R. N. Lee. Space-time dimensionality d as complex variable: calculating loop integrals using dimensional recurrence relation and analytical properties with respect to d. Nucl. Phys. B , 830:474–492, 2010. arXiv:0911.0252, doi:10.1016/j.nuclphysb.2009.12.025
-
[16]
Integration-by-parts: A survey
Peter Marquard. Integration-by-parts: A survey. In Johannes Blümlein and Carsten Schneider, editors, Anti-Differentiation and the Calculation of Feynman Amplitudes , pages 313–320. Springer, Berlin, Heidelberg, 2021. doi:10.1007/978-3-030-80219-6_13
-
[17]
Two decades of algorithmic feynman integral reduction
Alexander Smirnov and Vladimir Smirnov. Two decades of algorithmic feynman integral reduction. 2025. arXiv:2510.10748
-
[18]
C. Anastasiou and A. Lazopoulos. Automatic integral reduction for higher order perturbative calculations. JHEP, 07:046, 2004. arXiv:hep-ph/0404258, doi:10.1088/1126-6708/2004/07/046
-
[19]
A. V. Smirnov. Algorithm fire – feynman integral reduction. JHEP, 10:107, 2008. arXiv:0807.3243, doi:10.1088/1126-6708/2008/10/107
-
[20]
C. Studerus. Reduze - feynman integral reduction in c++. Comput. Phys. Commun. , 181:1293–1300, 2010. arXiv:0912.2546, doi:10.1016/j.cpc.2010.03.012
-
[21]
R. N. Lee. Presenting litered: a tool for the loop integrals reduction. 2012. arXiv:1212.2685
work page Pith review arXiv 2012
-
[22]
Roman N. Lee. Litered 1.4: a powerful tool for reduction of multiloop integrals. J. Phys. Conf. Ser. , 523:012059, 2014. doi:10.1088/1742-6596/523/1/012059
-
[23]
Christoph Dlapa, Gregor Kälin, Zhengwen Liu, and Rafael A. Porto. Nonlocal-in-time tail effects in gravitational scattering to fifth Post-Minkowskian and tenth self-force orders. 4
-
[24]
Reduze 2 - Distributed Feynman Integral Reduction
Andreas von Manteuffel and Cedric Studerus. Reduze 2 - distributed feynman integral reduction. 2012. arXiv:1201.4330. – 63 –
work page Pith review arXiv 2012
-
[25]
A. V. Smirnov and F. S. Chukharev. Fire6: Feynman integral reduction with modular arithmetic. Comput. Phys. Commun. , 247:106877, 2020. arXiv:1901.07808, doi:10.1016/j.cpc.2019.106877
-
[26]
Alexander V. Smirnov and Mao Zeng. Fire 6.5: Feynman integral reduction with new simplification library. Comput.Phys.Commun., 302:109261, 2024. arXiv:2311.02370, doi:10.1016/j.cpc.2024.109261
-
[27]
Kira—a feynman integral reduction program
Philipp Maierhöfer, Johann Usovitsch, and Peter Uwer. Kira—a feynman integral reduction program. Comput. Phys. Commun. , 230:99–112, 2018. arXiv:1705.05610, doi:10.1016/j.cpc.2018.04.012
-
[28]
Integral reduction with kira 2.0 and finite field methods
Jonas Klappert, Fabian Lange, Philipp Maierhöfer, and Johann Usovitsch. Integral reduction with kira 2.0 and finite field methods. Comput. Phys. Commun. , 266:108024, 2021. arXiv:2008.06494, doi:10.1016/j.cpc.2021.108024
-
[29]
Blade: A package for block-triangular form improved feynman integrals decomposition
Xin Guan, Xiao Liu, Yan-Qing Ma, and Wen-Hao Wu. Blade: A package for block-triangular form improved feynman integrals decomposition. Comput.Phys.Commun., 310:109538, 2025. arXiv:2405.14621, doi:10.1016/j.cpc.2025.109538
-
[30]
Neatibp 1.0, a package generating small-size integration-by-parts relations for feynman integrals
Zihao Wu, Janko Boehm, Rourou Ma, Hefeng Xu, and Yang Zhang. Neatibp 1.0, a package generating small-size integration-by-parts relations for feynman integrals. Comput. Phys. Commun., 295:108999, 2024. arXiv:2305.08783, doi:10.1016/j.cpc.2023.108999
-
[31]
Performing integration-by-parts reductions using neatibp 1.1 + kira
Zihao Wu, Janko Böhm, Rourou Ma, Johann Usovitsch, Yingxuan Xu, and Yang Zhang. Performing integration-by-parts reductions using neatibp 1.1 + kira. Comput.Phys.Commun., 316:109798, 2025. arXiv:2502.20778, doi:10.1016/j.cpc.2025.109798
-
[32]
Symbolic reduction of multi-loop feynman integrals via generating functions
Bo Feng, Xiang Li, Yuanche Liu, Yan-Qing Ma, and Yang Zhang. Symbolic reduction of multi-loop feynman integrals via generating functions. 2025. arXiv:2509.21769
-
[33]
Andreas von Manteuffel and Robert M. Schabinger. A novel approach to integration by parts reduction. Phys. Lett. B , 744:101–104, 2015. arXiv:1406.4513, doi:10.1016/j.physletb.2015.03.029
-
[34]
Kasper J. Larsen and Yang Zhang. Integration-by-parts reductions from unitarity cuts and algebraic geometry. Phys. Rev. D , 93:041701, 2016. arXiv:1511.01071, doi:10.1103/PhysRevD.93.041701
-
[35]
Module intersection for the integration-by-parts reduction of multi-loop feynman integrals
Dominik Bendle, Janko Boehm, Wolfram Decker, Alessandro Georgoudis, Franz-Josef Pfreundt, Mirko Rahn, and Yang Zhang. Module intersection for the integration-by-parts reduction of multi-loop feynman integrals. PoS, MA2019:004, 2022. arXiv:2010.06895, doi:10.22323/1.383.0004
-
[36]
Reduction to master integrals and transverse integration identities
Vsevolod Chestnov, Gaia Fontana, and Tiziano Peraro. Reduction to master integrals and transverse integration identities. JHEP, 03:113, 2025. arXiv:2409.04783, doi:10.1007/JHEP03(2025)113
-
[37]
Feynman integral reduction using syzygy-constrained symbolic reduction rules
Sid Smith and Mao Zeng. Feynman integral reduction using syzygy-constrained symbolic reduction rules. JHEP, 01:102, 2026. arXiv:2507.11140, doi:10.1007/JHEP01(2026)102
-
[38]
Junhan W. Liu and Alexander Mitov. Untangling the ibp equations. 2025. arXiv:2512.05923
- [39]
-
[40]
Feynman integral reduction by covariant differentiation
Gero von Gersdorff and Vinicius Lessa. Feynman integral reduction by covariant differentiation. 2026. arXiv:2604.09810
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[41]
Refining integration-by-parts reduction of feynman integrals with machine learning
Matt von Hippel and Matthias Wilhelm. Refining integration-by-parts reduction of feynman integrals with machine learning. JHEP, 05:185, 2025. arXiv:2502.05121, doi:10.1007/JHEP05(2025)185
-
[42]
Mao Zeng. Reinforcement learning and metaheuristics for feynman-integral reduction. Phys.Rev.D, 112:114051, 2025. arXiv:2504.16045, doi:10.1103/dmlf-jkfc
-
[43]
Learning to Unscramble Feynman Loop Integrals with SAILIR
David Shih. Learning to unscramble feynman loop integrals with sailir. 2026. arXiv:2604.05034
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[44]
Improving integration-by-parts and differential equations
Iris Bree et al. Improving integration-by-parts and differential equations. 2 2026. arXiv:2602.10651
-
[45]
New algorithms for Feynman integral reduction and $\varepsilon$-factorised differential equations
Iris Bree et al. New algorithms for Feynman integral reduction and ε-factorised differential equations. 11 2025. arXiv:2511.15381
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[46]
Iris Bree et al. The geometric bookkeeping guide to Feynman integral reduction and ε-factorised differential equations. 6 2025. arXiv:2506.09124
-
[47]
Feynman Integrals and Intersection Theory
Pierpaolo Mastrolia and Sebastian Mizera. Feynman Integrals and Intersection Theory. JHEP, 02:139, 2019. arXiv:1810.03818, doi:10.1007/JHEP02(2019)139
-
[48]
Mandal, Pierpaolo Mastrolia, Luca Mattiazzi, and Sebastian Mizera
Hjalte Frellesvig, Federico Gasparotto, Stefano Laporta, Manoj K. Mandal, Pierpaolo Mastrolia, Luca Mattiazzi, and Sebastian Mizera. Decomposition of Feynman Integrals on the Maximal Cut by Intersection Numbers. JHEP, 05:153, 2019. arXiv:1901.11510, doi:10.1007/JHEP05(2019)153
-
[49]
Mandal, Pierpaolo Mastrolia, Luca Mattiazzi, and Sebastian Mizera
Hjalte Frellesvig, Federico Gasparotto, Manoj K. Mandal, Pierpaolo Mastrolia, Luca Mattiazzi, and Sebastian Mizera. Vector Space of Feynman Integrals and Multivariate Intersection Numbers. Phys. Rev. Lett. , 123(20):201602, 2019. arXiv:1907.02000, doi:10.1103/PhysRevLett.123.201602
-
[50]
From Infinity to Four Dimensions: Higher Residue Pairings and Feynman Integrals
Sebastian Mizera and Andrzej Pokraka. From Infinity to Four Dimensions: Higher Residue Pairings and Feynman Integrals. JHEP, 02:159, 2020. arXiv:1910.11852, doi:10.1007/JHEP02(2020)159
-
[51]
On the computation of intersection numbers for twisted cocycles
Stefan Weinzierl. On the computation of intersection numbers for twisted cocycles. J. Math. Phys., 62(7):072301, 2021. arXiv:2002.01930, doi:10.1063/5.0054292
-
[52]
Mandal, Pierpaolo Mastrolia, Luca Mattiazzi, and Sebastian Mizera
Hjalte Frellesvig, Federico Gasparotto, Stefano Laporta, Manoj K. Mandal, Pierpaolo Mastrolia, Luca Mattiazzi, and Sebastian Mizera. Decomposition of Feynman Integrals by Multivariate Intersection Numbers. JHEP, 03:027, 2021. arXiv:2008.04823, doi:10.1007/JHEP03(2021)027
-
[53]
Reduction to master integrals via intersection numbers and polynomial expansions
Gaia Fontana and Tiziano Peraro. Reduction to master integrals via intersection numbers and polynomial expansions. JHEP, 08:175, 2023. arXiv:2304.14336, doi:10.1007/JHEP08(2023)175
-
[54]
Recursive structure of Baikov representations: The top-down reduction with intersection theory
Xuhang Jiang, Ming Lian, and Li Lin Yang. Recursive structure of Baikov representations: The top-down reduction with intersection theory. Phys. Rev. D , 109(7):076020, 2024. arXiv:2312.03453, doi:10.1103/PhysRevD.109.076020
-
[55]
Feynman integral reductions by intersection theory with orthogonal bases and closed formulae
Giulio Crisanti and Sid Smith. Feynman integral reductions by intersection theory with orthogonal bases and closed formulae. JHEP, 09:018, 2024. arXiv:2405.18178, doi:10.1007/JHEP09(2024)018. – 65 –
-
[56]
Intersection theory, relative cohomology and the Feynman parametrization
Mingming Lu, Ziwen Wang, and Li Lin Yang. Intersection theory, relative cohomology and the Feynman parametrization. JHEP, 05:158, 2025. arXiv:2411.05226, doi:10.1007/JHEP05(2025)158
-
[57]
Feynman integral reduction with intersection theory made simple
Li-Hong Huang, Yan-Qing Ma, Ziwen Wang, and Li Lin Yang. Feynman integral reduction with intersection theory made simple. 2026. arXiv:2604.05025
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[58]
Calculating Massive 3-loop Graphs for Operator Matrix Elements by the Method of Hyperlogarithms
Jakob Ablinger, Johannes Blümlein, Clemens Raab, Carsten Schneider, and Fabian Wißbrock. Calculating Massive 3-loop Graphs for Operator Matrix Elements by the Method of Hyperlogarithms. Nucl. Phys. B , 885:409–447, 2014. arXiv:1403.1137, doi:10.1016/j.nuclphysb.2014.04.007
-
[59]
David A. Kosower. Direct Solution of Integration-by-Parts Systems. Phys. Rev. D , 98(2):025008, 2018. arXiv:1804.00131, doi:10.1103/PhysRevD.98.025008
-
[60]
Generation function for one-loop tensor reduction
Bo Feng. Generation function for one-loop tensor reduction. Commun. Theor. Phys. , 75(2):025203, 2023. arXiv:2209.09517, doi:10.1088/1572-9494/aca253
-
[61]
An explicit expression of generating function for one-loop tensor reduction
Chang Hu, Tingfei Li, Jiyuan Shen, and Yongqun Xu. An explicit expression of generating function for one-loop tensor reduction. JHEP, 02:158, 2024. arXiv:2308.13336, doi:10.1007/JHEP02(2024)158
-
[62]
Solving arbitrary one-loop reduction via generating function
Tingfei Li, Yuekai Song, and Liang Zhang. Solving arbitrary one-loop reduction via generating function. Eur. Phys. J. C , 85:142, 2025. arXiv:2404.04644, doi:10.1140/epjc/s10052-025-13848-0
-
[63]
Tensor Reduction of Sunset by Generating Function
Xinhe Chen, Bo Feng, and Liang Zhang. Tensor Reduction of Sunset by Generating Function. 9 2025. arXiv:2509.18730
-
[64]
Exploring the linear space of feynman integrals via generating functions
Xin Guan, Xiang Li, and Yan-Qing Ma. Exploring the linear space of feynman integrals via generating functions. Phys. Rev. D , 108:034027, 2023. arXiv:2306.02927, doi:10.1103/PhysRevD.108.034027
-
[65]
General one-loop generating function by integration-by-part relations
Chang Hu, Bo Feng, Jiyuan Shen, and Yaobo Zhang. General one-loop generating function by integration-by-part relations. Phys. Rev. D , 111(7):076026, 2025. arXiv:2403.16040, doi:10.1103/PhysRevD.111.076026
-
[66]
Generating function of loop reduction by baikov representation
Chang Hu, Wen-Di Li, and Xiang Li. Generating function of loop reduction by baikov representation. 2025. arXiv:2504.02573. – 66 –
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.