Pith. sign in

REVIEW 3 major objections 6 minor 1 cited by

Direct Expression for One-Loop Tensor Reduction with Lorentz Indices via Generating Function

T0 review · 3 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read A generating-function formula reduces one-loop tensor integrals with Lorentz indices directly to scalar master integrals, with rational coefficients and no recursion.

desk verdict A plausible but incomplete repackaging of the authors' own generating-function reduction into rational Lorentz-indexed building blocks; the n→n case is solid, the general n→n−k formula lacks a derivation, and the box verification table is invalid. read the letter →

arxiv 2501.11150 v1 pith:BPRIR7N4 submitted 2025-01-19 hep-th hep-ph

Chang Hu , Yifan Hu , Jiyuan Shen This is my paper · ORCID
classification hep-thhep-ph
keywords one-looptensorreductiongeneratingfunctionLorentzindicescoefficientsrationalformFeynmanintegralsbuildingblocks
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that one-loop tensor Feynman integrals with Lorentz indices can be reduced to scalar master integrals by substituting into a closed, recursion-free formula, rather than by iterative reduction or by solving a linear system. The authors take a generating-function expression that contains irrational square roots and an auxiliary vector $R$, introduce new variables $K$ and $T$, and argue that odd powers of the irrational $\Delta$ cancel because the final reduction coefficient is rational. The result is that every reduction coefficient becomes a polynomial in five types of tensor building blocks times a coefficient $\Omega$ depending only on the spacetime dimension $D$, the number of propagators $n$, the number of removed propagators $k$, and the tensor rank $r$. Because all masses and momentum invariants live inside the building blocks, the formula is directly usable and practical; the paper supports it with a ready-to-run notebook implementation and with numerical checks for tadpole, bubble, triangle, and box integrals.

What carries the argument

The machinery is a fixed set of five building blocks: $K$ and $M$, defined through $x_+$ and $x_-$ by $K=x_+ + x_-$ and $M=x_+ x_-$; $T$, defined as the square of the irrational difference $\Delta=x_+ - x_-$; and $X(b)$ and $Y(b)$, which are respectively linear and quadratic in the auxiliary vector and therefore carry one or two Lorentz indices when translated. Written with appended label subscripts (for example $[K]_{a'_2\cdots a'_k}$), these blocks absorb all dependence on masses and external momenta. The paper's mechanism is to expand the generating-function reduction coefficient in powers of $\Delta$, use the rationality of the final coefficient to discard every odd power, and rewrite $\Delta^2$ as $T$. Once the coefficient is a homogeneous polynomial in these blocks, Lorentz indices are assigned by replacing each block with its metric and momentum translation and summing over permutations with a $1/r!$ symmetry factor.

What would settle it

Compute the reduction coefficient for a rank-8 tensor triangle reduced to a tadpole with generic masses and momenta using formula (3.41), and compare each resulting coefficient with the corresponding output of an independent reduction package; any mismatch beyond numerical precision would falsify the claim.

Watch

Extended reading notes

Core claim

The central result is formula (3.41), which expresses the coefficient that reduces an $n$-gon one-loop tensor integral of rank $r$ to an $(n-k)$-gon master integral as a sum over all allowed exponent configurations of products of the five building blocks, followed by a sum over permutations of the removed propagator labels. Each monomial carries exactly $r$ Lorentz indices, and the coefficient $\Omega^r_{n\to n-k}(\alpha,\beta,\gamma,\theta)$ is a rational function of $D-n$ only. This replaces the traditional approach of building tensor structures from external momenta and the metric and then inverting a matrix with an algorithm that constructs the coefficient directly. The paper also shows that the number of independent tensor structures in this method is smaller than in the conventional reduction whenever $k<n/2$, and reports numerical agreement with an independent reduction package for ranks up to eight.

Load-bearing premise

The load-bearing premise is that every one-loop reduction coefficient can be written as a polynomial in the five listed building blocks $X$, $Y$, $K$, $M$, and $T$; the paper demonstrates this structure on a $k=3$ example and assumes it extends to all $k$ and $r$.

Editorial extensions

If this is right

  • For a given $n$, $k$, and $r$, reduction coefficients are obtained by direct substitution into the five building blocks and the coefficient $\Omega$; no recursion or matrix inversion is required.
  • Because the kinematic dependence is confined to the building blocks while $\Omega$ depends only on $D-n$, the coefficient part can be precomputed and reused across different processes.
  • When $k<n/2$, the number of independent tensor structures produced by this method is smaller than in the traditional reduction, lowering the symbolic cost of each integral.
  • The verified numerical checks for tadpole, bubble, triangle, and box integrals show that the formula is ready for direct use in practical one-loop calculations for the tested ranks.
  • The rational form naturally extends to integrals with explicit Lorentz indices, which is the form needed in most physical applications.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because $\Omega$ depends only on $D-n$, one could tabulate it once for all $(k,r)$ and reuse it across integrals with the same $n$ and different kinematics, extending the speed advantage beyond the paper's implemented notebook.
  • The same rationality argument that drops odd powers of $\Delta$ may apply to other generating-function reduction schemes, potentially yielding direct Lorentz-index formulas for more general numerators or for other loop topologies.
  • A closed hypergeometric expression for $\Omega$ in the general $(n,k,r)$ case would remove the need to extract coefficients from the previous recursive expression, making the formula fully analytic.
  • The appearance of $D-n$ as the only parameter in $\Omega$ suggests that dimensional recurrence or analytic continuation in $D$ could give results in shifted dimensions without rerunning the reduction.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper presents a generating-function-based, recursion-free reduction of one-loop tensor Feynman integrals to master integrals, with the final coefficients expressed directly in terms of Lorentz-indexed tensor building blocks. After reviewing the earlier coefficient formula (2.9) from the authors' previous work [1], the paper rationalizes the irrational terms, defines five types of rational building blocks (X, Y, K, M, T) in Eq. (3.39), and states in Eq. (3.41) a general formula for the reduction coefficient C(r)_{n->n-k} as a sum over these blocks with coefficients Omega that depend only on D, n, k, and r. The n-gon to n-gon case is derived in full in Appendix A and given in closed form in Eq. (3.16). The paper also provides a Wolfram Mathematica implementation, analytic examples for bubble and triangle reductions, and numerical comparisons with AmpRed.

Significance. If the central formula (3.41) is correct and the building-block set in (3.39) is complete, the paper would provide a genuinely direct, recursion-free one-loop tensor reduction with Lorentz indices, avoiding the matrix inversions of standard Passarino-Veltman reduction and making the coefficients depend only on D, n, k, r. The paper's derivation of the n-gon to n-gon case is self-contained and appears correct, and the explicit analytic examples (Sec. 3.1.1, Sec. 3.2.2) agree with known results checked against AmpRed. The open-source Mathematica code, the emphasis on pre-computable building blocks, and the efficiency comparisons are positive features. However, the general (n-k)-gon formula rests on two load-bearing pillars that are not fully established in the manuscript: the completeness of the five-term building-block list for general k, and the explicit derivation of the coefficients Omega. The numerical validation also contains a serious apparent error in Table 11. These issues need to be resolved before the central claim can be accepted.

major comments (3)
  1. [Sec. 3.2.1] The general coefficient Omega in Eq. (3.41) is not derived. The text states that 'The derivation of the general expression for the coefficient Omega is a purely mathematical process and will therefore not be included in this paper,' and that the coefficient can be accessed using Mathematica and Eq. (2.9). Since Eq. (3.41) is the central claim of the paper, the paper does not provide a self-contained general formula for the reduction coefficients: the Omega coefficients for arbitrary n, k, r are defined only operationally. Please provide at least a constructive derivation or a closed-form algorithmic expression for Omega, and justify the stated property that the simplified numerator and denominator have degree at most r-k in D-n. Without this, the claim of a 'direct expression' is not fully supported.
  2. [Sec. 3.2, Eq. (3.39)] The five-building-block list in Eq. (3.39) is inferred from the single k=3 example analyzed below Eq. (3.38), with the statement that 'through a similar analysis, it can be easily seen that for the general case ... all the rational building blocks are in five types.' No proof is given for general k, and the list has a structurally nontrivial asymmetry: the M-type row omits [M]_{a'_1...a'_k} while the K-type row includes [K]_{a'_1...a'_k}. Because Eq. (3.41) sums only over monomials built from the listed types, any rational term outside this set appearing in the expansion of Eq. (2.9) would cause the formula to miss a contribution. Please supply a proof that the iterative 0/1-operators and the coefficients C^{(1)/(2)} in Section 2.2.2 produce only sums of products of the listed X, Y, K, M, and T blocks, or state and prove the identities that relate any additional candidates, such as [M]_{I_k}, to the listed building blocks.
  3. [Table 11] Table 11, described as the numerical check of C^{mu1...mu5}_{4->1;[1,2,3}, lists a 'Generating Functing' column that is identical to the values in Table 10, which reports the coefficients of C^{mu1...mu6}_{4->4}. The AmpRed column in Table 11 disagrees with these duplicated values. Thus, as printed, Table 11 does not validate the box-to-tadpole (k=3) reduction; it appears to be a copy of the previous table rather than the actual output of the authors' code. Please regenerate this table with the correct output, verify that the code produces the stated results, and reconcile the header (which indicates rank 5) with the displayed tensor blocks (which carry six Lorentz indices). This is a load-bearing issue because Table 11 is the only independent numerical check for the generic n-gon to (n-k)-gon case with k=3.
minor comments (6)
  1. [Title] The title contains a spacing glitch: 'T ensor' should read 'Tensor'.
  2. [Tables 7-11] The column header 'Generating Functing' is misspelled as 'Functing'; it should be 'Generating Function'. Additionally, the text in Appendix B refers to 'ApmRed' or 'AmpRed' inconsistently; the software name is 'AmpRed'.
  3. [Sec. 4.1, Eq. (4.4)] The counting formula GF(k,r) = PV(2k+1, r-k) is stated after the tables, but the combinatorial step from Eq. (4.2) to Eq. (4.4) is not shown. Please include a short derivation of this identity so that the efficiency comparison is transparent.
  4. [Sec. 2.2.2] There is a typo: 'thrid' should be 'third' in the description of the coefficient C^{(a'_1,...,a'_k)}_{{b_1,...,b_{k-1}}}.
  5. [Sec. 4.1] The word 'slove' should be 'solve' in the sentence 'we slove Ai by contracting...'.
  6. [Sec. 4.2] The Mathematica notebook is a welcome resource, but the manuscript should state the version/date of the code and note any dependencies beyond a standard Mathematica installation to ensure reproducibility.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation: the central formula (3.41) is a rationalizing rearrangement of the authors' prior Eq. (2.9), with Omega obtained by algebraic coefficient extraction; the main risks are an unproven completeness assertion and a questionable numerical check, not circularity.

full rationale

The paper's starting point is Eq. (2.9), taken verbatim from the authors' previous work [1]. The new contribution is to rewrite that expression in terms of the building blocks K, M, T, X, Y and to translate them into Lorentz-indexed tensors. This is an algebraic rearrangement, not a fit and not a tautology: the coefficients Omega are obtained by expanding (2.9) in the new variables, as stated in Section 3.2.1 ('the coefficient can be directly accessed using Mathematica and (2.9)'), which is coefficient extraction rather than circular prediction. The main gap is that the completeness of the five building-block types in (3.39) is inferred from a single k=3 example with the sentence 'Through a similar analysis, it can be easily seen that for the general case ... all the rational building blocks are in five types'; no proof for general k is supplied. This is a correctness/completeness risk, not a circularity, because the formula is not defined in terms of its own conclusion. The AmpRed comparisons in Tables 7-10 provide independent numerical support, although Table 11 appears to duplicate Table 10 in the 'Generating Functing' column while disagreeing with AmpRed, which weakens the verification for the 4-to-1 case but does not make the derivation circular. Overall, the derivation depends heavily on a self-cited prior formula, but it does not reduce to its own inputs by construction; a low circularity score is therefore appropriate.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The central formula depends on the previous expression (2.9), the standard rationality of reduction coefficients, and the asserted completeness of the building-block set. No parameters are fitted to data, and no new physical entities are introduced.

assumptions (3)
  • domain assumption The base generating-function expression (2.9) from [1] is correct.
    Section 2.2 reviews this expression and the entire paper builds on it. It is the previous work of the same group, published with an erratum.
  • domain assumption Reduction coefficients are rational functions of Mandelstam variables, masses, and D, so odd powers of Delta vanish after expansion.
    Used in Section 3.2 to eliminate [Delta]_Ik; the rationality is standard but not proven here.
  • ad hoc to paper The five building-block types in (3.39) are complete and independent for all n, k, r.
    The completeness is inferred from an example (I3={1,2,3}) and asserted generally in Section 3.2.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Direct Expression for One-Loop Tensor Reduction with Lorentz Indices via Generating Function." pith.science (2026). https://pith.science/paper/BPRIR7N4

@misc{pith2026250111150,
  author       = {Pith},
  title        = {Pith review of: Direct Expression for One-Loop Tensor Reduction with Lorentz Indices via Generating Function},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BPRIR7N4}},
  note         = {Machine review of arXiv:2501.11150}
}
abstract

In recent work, we derived a direct expression for one-loop tensor reduction using generating functions and Feynman parametrization in projective space, avoiding recursive relations. However, for practical applications, this expression still presents two challenges: (1) While the final reduction coefficients are expressed in terms of the dimension D and Mandelstam variables, the given expression explicitly contains irrational functions; (2) The expression involves an auxiliary vector R, which can be eliminated via differentiation $\frac{\partial}{\partial R}$, but the presence of irrational terms making differentiation cumbersome. (3) Most practical applications require the tensor form with Lorentz indices. In this paper, we provide a rational form of the reduction coefficients with Lorentz indices, free from recursion. Additionally, We provide a pure Wolfram Mathematica implementation of the code. Our practical tests demonstrate that this direct expression achieves significantly higher computational efficiency compared to the traditional Passarino-Veltman (PV) reduction or other recursion-based methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Tensor Reduction of Sunset by Generating Function

    hep-th 2025-09 conditional novelty 6.0 of 10

    A complete set of recurrence relations is derived to reduce any tensor integral of the sunset diagram to seven master integrals, using generating functions supplemented by syzygy equations.

Reference graph

Works this paper leans on

80 extracted references · 4 canonical work pages · cited by 1 Pith paper

  1. [1]

    C. Hu, T. Li, J. Shen, and Y. Xu,An explicit expression of generating function for one-loop tensor reduction, JHEP 02 (2024) 158, [arXiv:2308.13336]. [Erratum: JHEP 07, 068 (2024)]

    arXiv 2024

  2. [2]

    Ossola, C

    G. Ossola, C. G. Papadopoulos, and R. Pittau,Reducing full one-loop amplitudes to scalar integrals at the integrand level, Nucl. Phys. B763 (2007) 147–169, [hep-ph/0609007]

    arXiv 2007

  3. [3]

    Mastrolia and G

    P. Mastrolia and G. Ossola,On the Integrand-Reduction Method for Two-Loop Scattering Amplitudes, JHEP 11 (2011) 014, [arXiv:1107.6041]

    arXiv 2011

  4. [4]

    Badger, H

    S. Badger, H. Frellesvig, and Y. Zhang,Hepta-Cuts of Two-Loop Scattering Amplitudes, JHEP 04 (2012) 055, [arXiv:1202.2019]. – 39 –

    arXiv 2012

  5. [5]

    Zhang,Integrand-Level Reduction of Loop Amplitudes by Computational Algebraic Geometry Methods, JHEP 09 (2012) 042, [arXiv:1205.5707]

    Y. Zhang,Integrand-Level Reduction of Loop Amplitudes by Computational Algebraic Geometry Methods, JHEP 09 (2012) 042, [arXiv:1205.5707]

    arXiv 2012

  6. [6]

    K. J. Larsen and Y. Zhang,Integration-by-parts reductions from unitarity cuts and algebraic geometry, Phys. Rev. D93 (2016), no. 4 041701, [arXiv:1511.01071]

    arXiv 2016

  7. [7]

    Zhang,Lecture Notes on Multi-loop Integral Reduction and Applied Algebraic Geometry, 12, 2016

    Y. Zhang,Lecture Notes on Multi-loop Integral Reduction and Applied Algebraic Geometry, 12, 2016. arXiv:1612.02249

    arXiv 2016

  8. [8]

    Passarino and M

    G. Passarino and M. J. G. Veltman,One Loop Corrections for e+ e- Annihilation Into mu+ mu- in the Weinberg Model, Nucl. Phys. B160 (1979) 151–207

    1979

Show all 80 references
  1. [9]

    K. G. Chetyrkin and F. V. Tkachov,Integration by Parts: The Algorithm to Calculate beta Functions in 4 Loops, Nucl. Phys. B192 (1981) 159–204

    1981

  2. [10]

    F. V. Tkachov,A Theorem on Analytical Calculability of Four Loop Renormalization Group Functions, Phys. Lett. B100 (1981) 65–68

    1981

  3. [11]

    Laporta,High precision calculation of multiloop Feynman integrals by difference equations, Int

    S. Laporta,High precision calculation of multiloop Feynman integrals by difference equations, Int. J. Mod. Phys. A15 (2000) 5087–5159, [hep-ph/0102033]

    2000 arXiv

  4. [12]

    von Manteuffel and C

    A. von Manteuffel and C. Studerus,Reduze 2 - Distributed Feynman Integral Reduction, arXiv:1201.4330

    arXiv

  5. [13]

    Maierhöfer, J

    P. Maierhöfer, J. Usovitsch, and P. Uwer,Kira—A Feynman integral reduction program, Comput. Phys. Commun.230 (2018) 99–112, [arXiv:1705.05610]

    2018 arXiv

  6. [14]

    A. V. Smirnov and F. S. Chuharev,FIRE6: Feynman Integral REduction with Modular Arithmetic, Comput. Phys. Commun.247 (2020) 106877, [arXiv:1901.07808]

    2020 arXiv

  7. [15]

    von Manteuffel and R

    A. von Manteuffel and R. M. Schabinger,A novel approach to integration by parts reduction, Phys. Lett. B744 (2015) 101–104, [arXiv:1406.4513]

    2015 arXiv

  8. [16]

    Z. Bern, L. J. Dixon, D. C. Dunbar, and D. A. Kosower,Fusing gauge theory tree amplitudes into loop amplitudes, Nucl. Phys. B435 (1995) 59–101, [hep-ph/9409265]

    1995 arXiv

  9. [17]

    Z. Bern, L. J. Dixon, D. C. Dunbar, and D. A. Kosower,One loop n point gauge theory amplitudes, unitarity and collinear limits, Nucl. Phys. B425 (1994) 217–260, [hep-ph/9403226]

    1994 arXiv

  10. [18]

    Britto, F

    R. Britto, F. Cachazo, and B. Feng,Generalized unitarity and one-loop amplitudes in N=4 super-Yang-Mills, Nucl. Phys. B725 (2005) 275–305, [hep-th/0412103]

    2005 arXiv

  11. [19]

    Britto, E

    R. Britto, E. Buchbinder, F. Cachazo, and B. Feng,One-loop amplitudes of gluons in SQCD, Phys. Rev. D72 (2005) 065012, [hep-ph/0503132]

    2005 arXiv

  12. [20]

    Britto, B

    R. Britto, B. Feng, and P. Mastrolia,The Cut-constructible part of QCD amplitudes, Phys. Rev. D 73 (2006) 105004, [hep-ph/0602178]

    2006 arXiv

  13. [21]

    Anastasiou, R

    C. Anastasiou, R. Britto, B. Feng, Z. Kunszt, and P. Mastrolia,Unitarity cuts and Reduction to master integrals in d dimensions for one-loop amplitudes, JHEP 03 (2007) 111, [hep-ph/0612277]

    2007 arXiv

  14. [22]

    Anastasiou, R

    C. Anastasiou, R. Britto, B. Feng, Z. Kunszt, and P. Mastrolia,D-dimensional unitarity cut method, Phys. Lett. B645 (2007) 213–216, [hep-ph/0609191]

    2007 arXiv

  15. [23]

    Britto and B

    R. Britto and B. Feng,Unitarity cuts with massive propagators and algebraic expressions for coefficients, Phys. Rev. D75 (2007) 105006, [hep-ph/0612089]. – 40 –

    2007 arXiv

  16. [24]

    Britto and B

    R. Britto and B. Feng,Integral coefficients for one-loop amplitudes, JHEP 02 (2008) 095, [arXiv:0711.4284]

    2008 arXiv

  17. [25]

    Britto and E

    R. Britto and E. Mirabella,Single Cut Integration, JHEP 01 (2011) 135, [arXiv:1011.2344]

    2011 arXiv

  18. [26]

    W. T. Giele, Z. Kunszt, and K. Melnikov,Full one-loop amplitudes from tree amplitudes, JHEP 04 (2008) 049, [arXiv:0801.2237]

    2008 arXiv

  19. [27]

    Mastrolia and S

    P. Mastrolia and S. Mizera,Feynman Integrals and Intersection Theory, JHEP 02 (2019) 139, [arXiv:1810.03818]

    2019 arXiv

  20. [28]

    Frellesvig, F

    H. Frellesvig, F. Gasparotto, M. K. Mandal, P. Mastrolia, L. Mattiazzi, and S. Mizera, Vector Space of Feynman Integrals and Multivariate Intersection Numbers, Phys. Rev. Lett. 123 (2019), no. 20 201602, [arXiv:1907.02000]

    2019 arXiv

  21. [29]

    Mizera and A

    S. Mizera and A. Pokraka,From Infinity to Four Dimensions: Higher Residue Pairings and Feynman Integrals, JHEP 02 (2020) 159, [arXiv:1910.11852]

    2020 arXiv

  22. [30]

    Frellesvig, F

    H. Frellesvig, F. Gasparotto, S. Laporta, M. K. Mandal, P. Mastrolia, L. Mattiazzi, and S. Mizera,Decomposition of Feynman Integrals by Multivariate Intersection Numbers, JHEP 03 (2021) 027, [arXiv:2008.04823]

    2021 arXiv

  23. [31]

    Caron-Huot and A

    S. Caron-Huot and A. Pokraka,Duals of Feynman Integrals. Part II. Generalized unitarity, JHEP 04 (2022) 078, [arXiv:2112.00055]

    2022 arXiv

  24. [32]

    Caron-Huot and A

    S. Caron-Huot and A. Pokraka,Duals of Feynman integrals. Part I. Differential equations, JHEP 12 (2021) 045, [arXiv:2104.06898]

    2021 arXiv

  25. [33]

    Ossola, C

    G. Ossola, C. G. Papadopoulos, and R. Pittau,CutTools: A Program implementing the OPP reduction method to compute one-loop amplitudes, JHEP 03 (2008) 042, [arXiv:0711.3596]

    2008 arXiv

  26. [34]

    Maierhöfer and J

    P. Maierhöfer and J. Usovitsch,Kira 1.2 Release Notes, arXiv:1812.01491

    arXiv

  27. [35]

    Klappert, F

    J. Klappert, F. Lange, P. Maierhöfer, and J. Usovitsch,Integral reduction with Kira 2.0 and finite field methods, Comput. Phys. Commun.266 (2021) 108024, [arXiv:2008.06494]

    2021 arXiv

  28. [36]

    A. V. Smirnov,Algorithm FIRE – Feynman Integral REduction, JHEP 10 (2008) 107, [arXiv:0807.3243]

    2008 arXiv

  29. [37]

    A. V. Smirnov and V. A. Smirnov,FIRE4, LiteRed and accompanying tools to solve integration by parts relations, Comput. Phys. Commun.184 (2013) 2820–2827, [arXiv:1302.5885]

    2013 arXiv

  30. [38]

    A. V. Smirnov,FIRE5: a C++ implementation of Feynman Integral REduction, Comput. Phys. Commun. 189 (2015) 182–191, [arXiv:1408.2372]

    2015 arXiv

  31. [39]

    A. V. Smirnov and M. N. Tentyukov,Feynman Integral Evaluation by a Sector decomposiTion Approach (FIESTA), Comput. Phys. Commun.180 (2009) 735–746, [arXiv:0807.4129]

    2009 arXiv

  32. [40]

    A. V. Smirnov, V. A. Smirnov, and M. Tentyukov,FIESTA 2: Parallelizeable multiloop numerical calculations, Comput. Phys. Commun.182 (2011) 790–803, [arXiv:0912.0158]

    2011 arXiv

  33. [41]

    A. V. Smirnov,FIESTA 3: cluster-parallelizable multiloop numerical calculations in physical regions, Comput. Phys. Commun.185 (2014) 2090–2100, [arXiv:1312.3186]

    2014 arXiv

  34. [42]

    A. V. Smirnov,FIESTA4: Optimized Feynman integral calculations with GPU support, Comput. Phys. Commun.204 (2016) 189–199, [arXiv:1511.03614]. – 41 –

    2016 arXiv

  35. [43]

    A. V. Smirnov, N. D. Shapurov, and L. I. Vysotsky,FIESTA5: Numerical high-performance Feynman integral evaluation, Comput. Phys. Commun.277 (2022) 108386, [arXiv:2110.11660]

    2022 arXiv

  36. [44]

    Klappert and F

    J. Klappert and F. Lange,Reconstructing rational functions with FireFly, Comput. Phys. Commun. 247 (2020) 106951, [arXiv:1904.00009]

    2020 arXiv

  37. [45]

    Klappert, S

    J. Klappert, S. Y. Klein, and F. Lange,Interpolation of dense and sparse rational functions and other improvements in FireFly, Comput. Phys. Commun.264 (2021) 107968, [arXiv:2004.01463]

    2021 arXiv

  38. [46]

    Studerus,Reduze-Feynman Integral Reduction in C++, Comput

    C. Studerus,Reduze-Feynman Integral Reduction in C++, Comput. Phys. Commun.181 (2010) 1293–1300, [arXiv:0912.2546]

    2010 arXiv

  39. [47]

    R. N. Lee,Presenting LiteRed: a tool for the Loop InTEgrals REDuction, arXiv:1212.2685

    arXiv

  40. [48]

    Z. Wu, J. Boehm, R. Ma, H. Xu, and Y. Zhang,NeatIBP 1.0, A package generating small-size integration-by-parts relations for Feynman integrals, arXiv:2305.08783

    arXiv

  41. [49]

    X. Guan, X. Liu, and Y.-Q. Ma,Complete reduction of integrals in two-loop five-light-parton scattering amplitudes, Chin. Phys. C44 (2020), no. 9 093106, [arXiv:1912.09294]

    2020 arXiv

  42. [50]

    X. Guan, X. Liu, Y.-Q. Ma, and W.-H. Wu,Blade: A package for block-triangular form improved Feynman integrals decomposition, arXiv:2405.14621

    arXiv

  43. [51]

    Goode, F

    J. Goode, F. Herzog, A. Kennedy, S. Teale, and J. Vermaseren,Tensor reduction for Feynman integrals with Lorentz and spinor indices, JHEP 11 (2024) 123, [arXiv:2408.05137]

    2024 arXiv

  44. [52]

    Goode, F

    J. Goode, F. Herzog, and S. Teale,OPITeR: A program for tensor reduction of multi-loop Feynman Integrals, arXiv:2411.02233

    arXiv

  45. [53]

    Chen,Semi-automatic Calculations of Multi-loop Feynman Amplitudes with AmpRed, arXiv:2408.06426

    W. Chen,Semi-automatic Calculations of Multi-loop Feynman Amplitudes with AmpRed, arXiv:2408.06426

    arXiv

  46. [54]

    Peraro,FiniteFlow: multivariate functional reconstruction using finite fields and dataflow graphs, JHEP 07 (2019) 031, [arXiv:1905.08019]

    T. Peraro,FiniteFlow: multivariate functional reconstruction using finite fields and dataflow graphs, JHEP 07 (2019) 031, [arXiv:1905.08019]

    2019 arXiv

  47. [55]

    A. V. Belitsky, A. V. Smirnov, and R. V. Yakovlev,Balancing act: Multivariate rational reconstruction for IBP, Nucl. Phys. B993 (2023) 116253, [arXiv:2303.02511]

    2023 arXiv

  48. [56]

    A. V. Smirnov and V. A. Smirnov,How to choose master integrals, Nucl. Phys. B960 (2020) 115213, [arXiv:2002.08042]

    2020 arXiv

  49. [57]

    Usovitsch,Factorization of denominators in integration-by-parts reductions, arXiv:2002.08173

    J. Usovitsch,Factorization of denominators in integration-by-parts reductions, arXiv:2002.08173

    2002 arXiv

  50. [58]

    Anastasiou and A

    C. Anastasiou and A. Lazopoulos,Automatic integral reduction for higher order perturbative calculations, JHEP 07 (2004) 046, [hep-ph/0404258]

    2004 arXiv

  51. [59]

    Abreu, J

    S. Abreu, J. Dormans, F. Febres Cordero, H. Ita, and B. Page,Analytic Form of Planar Two-Loop Five-Gluon Scattering Amplitudes in QCD, Phys. Rev. Lett.122 (2019), no. 8 082002, [arXiv:1812.04586]

    2019 arXiv

  52. [60]

    R. K. Ellis and G. Zanderighi,Scalar one-loop integrals for QCD, JHEP 02 (2008) 002, [arXiv:0712.1851]

    2008 arXiv

  53. [61]

    Carrazza, R

    S. Carrazza, R. K. Ellis, and G. Zanderighi,QCDLoop: a comprehensive framework for one-loop scalar integrals, Comput. Phys. Commun.209 (2016) 134–143, [arXiv:1605.03181]. – 42 –

    2016 arXiv

  54. [62]

    Denner and S

    A. Denner and S. Dittmaier,Reduction of one loop tensor five point integrals, Nucl. Phys. B 658 (2003) 175–202, [hep-ph/0212259]

    2003 arXiv

  55. [63]

    Denner, S

    A. Denner, S. Dittmaier, and L. Hofer,Collier: a fortran-based Complex One-Loop LIbrary in Extended Regularizations, Comput. Phys. Commun.212 (2017) 220–238, [arXiv:1604.06792]

    2017 arXiv

  56. [64]

    Mastrolia, T

    P. Mastrolia, T. Peraro, and A. Primo,Adaptive Integrand Decomposition in parallel and orthogonal space, JHEP 08 (2016) 164, [arXiv:1605.03157]

    2016 arXiv

  57. [65]

    B. Feng, T. Li, and X. Li,Analytic tadpole coefficients of one-loop integrals, JHEP 09 (2021) 081, [arXiv:2107.03744]

    2021 arXiv

  58. [66]

    C. Hu, T. Li, and X. Li,One-loop Feynman integral reduction by differential operators, Phys. Rev. D 104 (2021), no. 11 116014, [arXiv:2108.00772]

    2021 arXiv

  59. [67]

    B. Feng, T. Li, H. Wang, and Y. Zhang,Reduction of general one-loop integrals using auxiliary vector, JHEP 05 (2022) 065, [arXiv:2203.14449]

    2022 arXiv

  60. [68]

    Feng and T

    B. Feng and T. Li,PV-reduction of sunset topology with auxiliary vector, Commun. Theor. Phys. 74 (2022), no. 9 095201, [arXiv:2203.16881]

    2022 arXiv

  61. [69]

    B. Feng, J. Gong, and T. Li,Universal treatment of the reduction for one-loop integrals in a projective space, Phys. Rev. D106 (2022), no. 5 056025, [arXiv:2204.03190]

    2022 arXiv

  62. [70]

    B. Feng, C. Hu, T. Li, and Y. Song,Reduction with degenerate Gram matrix for one-loop integrals, JHEP 08 (2022) 110, [arXiv:2205.03000]

    2022 arXiv

  63. [71]

    Li,Nontrivial one-loop recursive reduction relation, JHEP 07 (2023) 051, [arXiv:2209.11428]

    T. Li,Nontrivial one-loop recursive reduction relation, JHEP 07 (2023) 051, [arXiv:2209.11428]

    2023 arXiv

  64. [72]

    Zhang,Tensor loop reduction via the Baikov representation and an auxiliary vector, Phys

    L. Zhang,Tensor loop reduction via the Baikov representation and an auxiliary vector, Phys. Rev. D 110 (2024), no. 1 016013, [arXiv:2309.00930]

    2024 arXiv

  65. [73]

    Feng,Generation function for one-loop tensor reduction, Commun

    B. Feng,Generation function for one-loop tensor reduction, Commun. Theor. Phys.75 (2023), no. 2 025203, [arXiv:2209.09517]

    2023 arXiv

  66. [74]

    Ablinger, J

    J. Ablinger, J. Blümlein, C. Raab, C. Schneider, and F. Wißbrock,Calculating Massive 3-loop Graphs for Operator Matrix Elements by the Method of Hyperlogarithms, Nucl. Phys. B 885 (2014) 409–447, [arXiv:1403.1137]

    2014 arXiv

  67. [75]

    D. A. Kosower,Direct Solution of Integration-by-Parts Systems, Phys. Rev. D98 (2018), no. 2 025008, [arXiv:1804.00131]

    2018 arXiv

  68. [76]

    X. Guan, X. Li, and Y.-Q. Ma,Exploring the linear space of Feynman integrals via generating functions, arXiv:2306.02927

    arXiv

  69. [77]

    B. Feng, C. Hu, J. Shen, and Y. Zhang,General One-loop Generating Function by IBP relations, arXiv:2403.16040

    arXiv

  70. [78]

    T. Li, Y. Song, and L. Zhang,Solving arbitrary one-loop reduction via generating function, arXiv:2404.04644

    arXiv

  71. [79]

    Chen, J.-W

    G. Chen, J.-W. Kim, and T. Wang,Systematic integral evaluation for spin-resummed binary dynamics, Phys. Rev. D111 (2025), no. 2 L021701, [arXiv:2406.17658]

    2025 arXiv

  72. [80]

    Brandhuber, G

    A. Brandhuber, G. R. Brown, G. Chen, G. Travaglini, and P. Vives Matasan,Spinning waveforms in cubic effective field theories of gravity, JHEP 12 (2024) 039, [arXiv:2408.00587]. – 43 –

    2024 arXiv

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.