SearcharxivSearch

arXiv subjects

Dmytro Melnichenko

Publications and source records attributed to Dmytro Melnichenko.

4 recordsLinked to original sources

An algorithm towards $\varepsilon$-factorising Feynman Integrals

In this talk, we use several examples to elaborate on how a recently proposed algorithm can turn non-trivial Feynman integrals into an $\varepsilon $-factorised manner, regardless of their hidden geometric essence. In particular, some extra details about three-loop banana integrals with unequal-mass configuration are provided.

hep-th

Improving integration-by-parts and differential equations

In this talk, we discuss how ideas from geometry help to improve Feynman integral reduction and the construction of $\varepsilon$-factorised differential equations. In particular, we outline a systematic procedure to obtain an $\varepsilon$-factorised differential equation for any Feynman integral.

hep-th

New algorithms for Feynman integral reduction and $\varepsilon$-factorised differential equations

In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric order relation in the integration-by-parts reduction to obtain a basis of master integrals, whose differential equations on the maximal cut are of a Laurent polynomial form in the regularisation parameter $\varepsilon$ and compatible with a filtration. This step works entirely with rational functions. In a second step, we provide a method to $\varepsilon$-factorise the aforementioned Laurent differential equations. The second step may introduce algebraic and transcendental functions. We illustrate the versatility of the algorithm by applying it to different examples with a wide range of complexity.

hep-th

The geometric bookkeeping guide to Feynman integral reduction and $\varepsilon$-factorised differential equations

We report on three improvements in the context of Feynman integral reduction and $\varepsilon$-factorised differential equations: Firstly, we show that with a specific choice of prefactors, we trivialise the $\varepsilon$-dependence of the integration-by-parts identities. Secondly, we observe that with a specific choice of order relation in the Laporta algorithm, we directly obtain a basis of master integrals, whose differential equation on the maximal cut is in Laurent polynomial form with respect to $\varepsilon$ and compatible with a particular filtration. Thirdly, we prove that such a differential equation can always be transformed to an $\varepsilon$-factorised form. This provides a systematic algorithm to obtain an $\varepsilon$-factorised differential equation for any Feynman integral. Furthermore, the choices for the prefactors and the order relation significantly improve the efficiency of the reduction algorithm.

hep-th