pith. sign in

arxiv: 2606.31994 · v1 · pith:VB3MQLXNnew · submitted 2026-06-30 · ✦ hep-th · hep-ph

The geometric bookkeeping guide for varepsilon-factorised differential equations

Antonela Matija\v{s}i\'c This is my paper

Pith reviewed 2026-07-01 03:53 UTC · model grok-4.3

classification ✦ hep-th hep-ph
keywords Feynman integralsdifferential equationsε-factorisationLaporta algorithmBaikov representationtwisted cohomologydimensional regularisation
0
0 comments X

The pith

Ordering Feynman integrals by geometric properties in the Laporta algorithm produces bases whose differential equations are Laurent polynomials in the regulator ε, which can then be transformed into ε-factorised form.

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

The paper develops a two-step algorithmic procedure to construct ε-factorised differential equations for arbitrary families of multi-loop Feynman integrals in dimensional regularisation. The first step applies a geometric ordering to the selection of master integrals inside each sector during the Laporta reduction; this ordering is observed to guarantee that the resulting differential-equation matrix is a Laurent polynomial in ε. The second step builds explicit transformation matrices that factor the ε dependence out of the system entirely. A sympathetic reader would care because ε-factorised systems admit straightforward power-series solutions order by order in the regulator, which is the standard route to high-precision predictions for collider observables.

Core claim

In the setting of twisted cohomology we study the space of differential forms associated with a given family of Feynman integrals in the Baikov representation. We introduce a particular ordering for the Laporta algorithm that orders Feynman integrals within a sector according to their geometric properties. We observe that this order relation yields a basis whose differential equation is in a Laurent polynomial form in the dimensional regulator ε. In the second step we systematically construct transformation matrices such that the resulting system is in the ε-factorised form.

What carries the argument

The geometric ordering relation imposed on the Laporta algorithm within each sector, which selects a basis whose differential-equation matrix is guaranteed to be a Laurent polynomial in ε.

If this is right

  • The resulting system can be integrated order by order in ε without additional ansätze for the ε dependence.
  • The procedure applies uniformly to any integral family and does not require prior knowledge of its specific geometry.
  • Once the initial Laurent-polynomial matrix is obtained, the transformation matrices to ε-factorised form can be constructed algorithmically.
  • The method works inside the Baikov representation and the language of twisted cohomology.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same geometric ordering might be portable to other reduction algorithms or to other regularisation parameters beyond ε.
  • If the ordering can be automated, it would remove the need for manual case-by-case analysis when setting up differential equations for new integral families.
  • The existence of a canonical Laurent-polynomial basis raises the question whether similar orderings exist that produce even simpler forms, such as strictly polynomial matrices.

Load-bearing premise

That ordering the integrals inside each sector by their geometric properties will reliably produce a basis whose differential equations are Laurent polynomials in ε for every integral family.

What would settle it

An explicit integral family for which the geometrically ordered Laporta basis still yields a differential-equation matrix containing non-polynomial dependence on ε that cannot be removed by any rational transformation matrix.

Figures

Figures reproduced from arXiv: 2606.31994 by Antonela Matija\v{s}i\'c.

Figure 1
Figure 1. Figure 1: A kite diagram. Blue lines represent propagators and external momenta with the mass 𝑚 2 , while the orange line represent the external momenta with the mass 𝑞 2 . Thinner black lines are massless. The top sector has seven master integrals that decompose with respect to 𝐹 • geom and 𝑊• filtration as shown on the right figure. 𝑤 = 𝑛 +𝑟, where 𝑟 is the number of consecutive non-zero residues that we can take.… view at source ↗
read the original abstract

Precision predictions for high-energy experiments rely on accurately evaluating multi-loop, multi-scale Feynman integrals in dimensional regularisation. The method of differential equations is by now the standard tool for this task, but its full power is only realised when the system can be brought into an $\varepsilon$-factorised form. In this talk, we present an algorithmic framework that systematically constructs $\varepsilon$-factorised differential equations for arbitrary integral families, independent of their underlying geometry. We work in the setting of twisted cohomology and study the space of differential forms associated with a given family of Feynman integrals in the Baikov representation. Our approach consists of two steps. First, we introduce a particular ordering for the Laporta algorithm that orders Feynman integrals within a sector according to their geometric properties. We observe that this order relation yields a basis whose differential equation is in a Laurent polynomial form in the dimensional regulator $\varepsilon$. In the second step, we systematically construct transformation matrices such that the resulting system is in the $\varepsilon$-factorised form.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper claims to present an algorithmic framework for constructing ε-factorised differential equations for arbitrary Feynman integral families in dimensional regularisation. Working in the twisted cohomology setting with Baikov representation, the approach has two steps: first, a particular ordering of integrals within each sector by their geometric properties in the Laporta algorithm, which is observed to produce a basis whose differential-equation matrix is a Laurent polynomial in ε; second, the systematic construction of transformation matrices that bring the system into ε-factorised form. The method is asserted to be independent of the underlying geometry of the integral family.

Significance. If the central observation on the geometric ordering holds generally, the framework would offer a systematic, geometry-independent algorithmic route to ε-factorised differential equations, which is valuable for precision multi-loop calculations in high-energy physics. The use of twisted cohomology provides a modern cohomological perspective that aligns with recent advances in the field.

major comments (1)
  1. [abstract / two-step approach] Abstract (two-step approach paragraph): the claim that the geometric ordering within sectors 'yields a basis whose differential equation is in a Laurent polynomial form in ε' is presented as an empirical observation with no general derivation or proof supplied. No argument is given showing why this ordering must eliminate all positive powers of ε for arbitrary integral families, independent of the Baikov polynomial or cohomology basis. This is load-bearing: if the observation fails for even one family, the subsequent transformation-matrix construction has no valid starting point.

Simulated Author's Rebuttal

1 responses · 1 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. We address the major comment below.

read point-by-point responses

  1. Referee: [abstract / two-step approach] Abstract (two-step approach paragraph): the claim that the geometric ordering within sectors 'yields a basis whose differential equation is in a Laurent polynomial form in ε' is presented as an empirical observation with no general derivation or proof supplied. No argument is given showing why this ordering must eliminate all positive powers of ε for arbitrary integral families, independent of the Baikov polynomial or cohomology basis. This is load-bearing: if the observation fails for even one family, the subsequent transformation-matrix construction has no valid starting point.

    Authors: We agree that the geometric ordering step is presented as an empirical observation rather than a general theorem, as stated in the manuscript with the phrasing 'We observe that this order relation yields a basis...'. The observation has been verified across multiple integral families with different Baikov polynomials and cohomology structures, providing the starting point for the systematic transformation-matrix construction. No general derivation is supplied because none is currently available. We will revise the abstract and the two-step approach description to state the empirical character more explicitly and to note the absence of a general proof, while adding further supporting examples. revision: partial

standing simulated objections not resolved
  • A general mathematical derivation or proof that the geometric ordering eliminates all positive powers of ε for arbitrary Feynman integral families is not available.

Circularity Check

0 steps flagged

No significant circularity; derivation relies on stated empirical observation rather than self-referential reduction

full rationale

The paper's two-step procedure begins with a geometric ordering inside the Laporta algorithm that is explicitly described as yielding (by observation) a Laurent-polynomial DE matrix in ε; the second step then constructs the ε-factorising transformations from that starting point. No equation or claim in the abstract reduces the observed property back to the ordering by definition, nor is any load-bearing premise justified solely by self-citation, fitted input renamed as prediction, or an ansatz imported from prior author work. The central algorithmic claim therefore remains independent of its own outputs and does not collapse into a tautology.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review yields no information on free parameters, axioms, or invented entities.

pith-pipeline@v0.9.1-grok · 5701 in / 1081 out tokens · 50116 ms · 2026-07-01T03:53:28.377465+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 10 linked inside Pith

  1. [1]

    I.Breeetal.[𝜀-collaboration],Phys.Rev.Lett.136,no.24,241602(2026)[arXiv:2506.09124 [hep-th]]

    arXiv 2026

  2. [2]

    Breeet al.[𝜖-collaboration], Phys

    I. Breeet al.[𝜖-collaboration], Phys. Rev. D113, no.11, 116019 (2026) [arXiv:2511.15381 [hep-th]]

    Pith/arXiv arXiv 2026

  3. [3]

    A.V.Kotikov,Phys.Lett.B267,123-127(1991)[erratum: Phys.Lett.B295,409-409(1992)]

    1991

  4. [4]

    Remiddi, Nuovo Cim

    E. Remiddi, Nuovo Cim. A110, 1435-1452 (1997) [arXiv:hep-th/9711188 [hep-th]]. 7 The geometric bookkeeping guide for𝜀-factorised differential equationsAntonela Matijašić

    arXiv 1997

  5. [5]

    Gehrmann and E

    T. Gehrmann and E. Remiddi, Nucl. Phys. B580, 485-518 (2000) [arXiv:hep-ph/9912329 [hep-ph]]

    Pith/arXiv arXiv 2000

  6. [6]

    F. V. Tkachov, Phys. Lett. B100, 65-68 (1981)

    1981

  7. [7]

    K. G. Chetyrkin and F. V. Tkachov, Nucl. Phys. B192, 159-204 (1981)

    1981

  8. [8]

    Laporta, Int

    S. Laporta, Int. J. Mod. Phys. A15, 5087-5159 (2000) [arXiv:hep-ph/0102033 [hep-ph]]

    Pith/arXiv arXiv 2000

  9. [9]

    X. Liu, Y. Q. Ma and C. Y. Wang, Phys. Lett. B779, 353-357 (2018) [arXiv:1711.09572 [hep-ph]]

    Pith/arXiv arXiv 2018

  10. [10]

    Liu and Y

    X. Liu and Y. Q. Ma, Comput. Phys. Commun.283, 108565 (2023) [arXiv:2201.11669 [hep-ph]]

    arXiv 2023

  11. [11]

    Z. F. Liu and Y. Q. Ma, Phys. Rev. Lett.129, no.22, 222001 (2022) [arXiv:2201.11637 [hep-ph]]

    arXiv 2022

  12. [12]

    Hidding, Comput

    M. Hidding, Comput. Phys. Commun.269, 108125 (2021) [arXiv:2006.05510 [hep-ph]]

    arXiv 2021

  13. [13]

    Armadillo, R

    T. Armadillo, R. Bonciani, S. Devoto, N. Rana and A. Vicini, Comput. Phys. Commun.282, 108545 (2023) [arXiv:2205.03345 [hep-ph]]

    arXiv 2023

  14. [14]

    R.M.Prisco,J.RoncaandF.Tramontano,JHEP07,219(2025)[arXiv:2501.01943[hep-ph]]

    arXiv 2025

  15. [15]

    P.PetitRosàsandW.J.TorresBobadilla,JHEP09,210(2025)[arXiv:2507.12548[hep-ph]]

    arXiv 2025

  16. [16]

    J. M. Henn, Phys. Rev. Lett.110, 251601 (2013) [arXiv:1304.1806 [hep-th]]

    Pith/arXiv arXiv 2013

  17. [17]

    K. T. Chen, Bull. Am. Math. Soc.83, 831-879 (1977)

    1977

  18. [18]

    Peraro, JHEP07, 031 (2019) [arXiv:1905.08019 [hep-ph]]

    T. Peraro, JHEP07, 031 (2019) [arXiv:1905.08019 [hep-ph]]

    Pith/arXiv arXiv 2019

  19. [19]

    R. N. Lee, J. Phys. Conf. Ser.523, 012059 (2014) [arXiv:1310.1145 [hep-ph]]

    Pith/arXiv arXiv 2014

  20. [20]

    X. Guan, X. Liu, Y. Q. Ma and W. H. Wu, Comput. Phys. Commun.310, 109538 (2025) [arXiv:2405.14621 [hep-ph]]

    arXiv 2025

  21. [21]

    Lange, J

    F. Lange, J. Usovitsch and Z. Wu, Comput. Phys. Commun.322, 109999 (2026) [arXiv:2505.20197 [hep-ph]]

    arXiv 2026

  22. [22]

    A. V. Smirnov and M. Zeng, [arXiv:2510.07150 [hep-ph]]

    arXiv

  23. [23]

    Forner, C

    F. Forner, C. C. Mella, C. Nega, L. Tancredi and F. J. Wagner, [arXiv:2604.25270 [hep-th]]

    Pith/arXiv arXiv

  24. [24]

    P. A. Baikov, Nucl. Instrum. Meth. A389, 347-349 (1997) [arXiv:hep-ph/9611449 [hep-ph]]

    Pith/arXiv arXiv 1997

  25. [25]

    Frellesvig and C

    H. Frellesvig and C. G. Papadopoulos, JHEP04, 083 (2017) [arXiv:1701.07356 [hep-ph]]. 8

    Pith/arXiv arXiv 2017