اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGroup structure of the integration-by-part identities and its application to the reduction of multiloop integrals
126
0
0.0
(
0
)
تأليف
R.N. Lee
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The excessiveness of integration-by-part (IBP) identities is discussed. The Lie-algebraic structure of the IBP identities is used to reduce the number of the IBP equations to be considered. It is shown that Lorentz-invariance (LI) identities do not bring any information additional to that contained in the IBP identities, and therefore, can be discarded.
قيم البحث
اقرأ أيضاً
In this manuscript, which is to appear in the proceedings of the conference MathemAmplitude 2019 in Padova, Italy, we provide an overview of the module intersection method for the the integration-by-parts (IBP) reduction of multi-loop Feynman integra
ls. The module intersection method, based on computational algebraic geometry, is a highly efficient way of getting IBP relations without double propagator or with a bound on the highest propagator degree. In this manner, trimmed IBP systems which are much shorter than the traditional ones can be obtained. We apply the modern, Petri net based, workflow management system GPI-Space in combination with the computer algebra system Singular to solve the trimmed IBP system via interpolation and efficient parallelization. We show, in particular, how to use the new plugin feature of GPI-Space to manage a global state of the computation and to efficiently handle mutable data. Moreover, a Mathematica interface to generate IBPs with restricted propagator degree, which is based on module intersection, is presented in this review.
Integration-by-parts identities between loop integrals arise from the vanishing integration of total derivatives in dimensional regularization. Generic choices of total derivatives in the Baikov or parametric representations lead to identities which
involve dimension shifts. These dimension shifts can be avoided by imposing a certain constraint on the total derivatives. The solutions of this constraint turn out to be a specific type of syzygies which correspond to logarithmic vector fields along the Gram determinant formed of the independent external and loop momenta. We present an explicit generating set of solutions in Baikov representation, valid for any number of loops and external momenta, obtained from the Laplace expansion of the Gram determinant. We provide a rigorous mathematical proof that this set of solutions is complete. This proof relates the logarithmic vector fields in question to ideals of submaximal minors of the Gram matrix and makes use of classical resolutions of such ideals.
I will present a new method for thinking about and for computing loop integrals based on differential equations. All required information is obtained by algebraic means and is encoded in a small set of simple quantities that I will describe. I will p
resent various applications, including results for all planar master integrals that are needed for the computation of NNLO QCD corrections to the production of two off-shell vector bosons in hadron collisions.
Monte Carlo integration using quantum computers has been widely investigated, including applications to concrete problems. It is known that quantum algorithms based on quantum amplitude estimation (QAE) can compute an integral with a smaller number o
f iterative calls of the quantum circuit which calculates the integrand, than classical methods call the integrand subroutine. However, the issues about the iterative operations in the integrand circuit have not been discussed so much. That is, in the high-dimensional integration, many random numbers are used for calculation of the integrand and in some cases similar calculations are repeated to obtain one sample value of the integrand. In this paper, we point out that we can reduce the number of such repeated operations by a combination of the nested QAE and the use of pseudorandom numbers (PRNs), if the integrand has the separable form with respect to contributions from distinct random numbers. The use of PRNs, which the authors originally proposed in the context of the quantum algorithm for Monte Carlo, is the key factor also in this paper, since it enables parallel computation of the separable terms in the integrand. Furthermore, we pick up one use case of this method in finance, the credit portfolio risk measurement, and estimate to what extent the complexity is reduced.
A method for reducing Feynman integrals, depending on several kinematic variables and masses, to a combination of integrals with fewer variables is proposed. The method is based on iterative application of functional equations proposed by the author.
The reduction of the one-loop scalar triangle and box integrals with massless internal propagators to simpler integrals is described in detail. The triangle integral depending on three variables is represented as a sum over three integrals depending on two variables. By solving the dimensional recurrence relations for these integrals, an analytic expression in terms of the $_2F_1$ Gauss hypergeometric function and the logarithmic function was derived. By using the functional equations, the one-loop box integral with massless internal propagators, which depends on six kinematic variables, was expressed as a sum of 12 terms. These terms are proportional to the same integral depending only on three variables different for each term. For this integral with three variables, an analytic result in terms of the $F_1$ Appell and $_2F_1$ Gauss hypergeometric functions was derived by solving the recurrence relation with respect to the spacetime dimension $d$. The reduction equations for the box integral with some kinematic variables equal to zero are considered.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
