اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVector Space of Feynman Integrals and Multivariate Intersection Numbers
121
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Feynman integrals obey linear relations governed by intersection numbers, which act as scalar products between vector spaces. We present a general algorithm for constructing multivariate intersection numbers relevant to Feynman integrals, and show for the first time how they can be used to solve the problem of integral reduction to a basis of master integrals by projections, and to directly derive functional equations fulfilled by the latter. We apply it to the derivation of contiguity relations for special functions admitting multi-fold integral representations, and to the decomposition of a few Feynman integrals at one- and two-loops, as first steps towards potential applications to generic multi-loop integrals.
قيم البحث
اقرأ أيضاً
We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, empl
oying multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers and provide three different approaches for a direct decomposition of Feynman integrals, which we dub the straight decomposition, the bottom-up decomposition, and the top-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.
Canonical Feynman integrals are of great interest in the study of scattering amplitudes at the multi-loop level. We propose to construct $dlog$-form integrals of the hypergeometric type, treat them as a representation of Feynman integrals, and projec
t them into master integrals using intersection theory. This provides a constructive way to build canonical master integrals whose differential equations can be solved easily. We use our method to investigate both the maximally cut integrals and the uncut ones at one and two loops, and demonstrate its applicability in problems with multiple scales.
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.
We introduce an algebro-geometrically motived integration-by-parts (IBP) reduction method for multi-loop and multi-scale Feynman integrals, using a framework for massively parallel computations in computer algebra. This framework combines the compute
r algebra system Singular with the workflow management system GPI-Space, which is being developed at the Fraunhofer Institute for Industrial Mathematics (ITWM). In our approach, the IBP relations are first trimmed by modern algebraic geometry tools and then solved by sparse linear algebra and our new interpolation methods. These steps are efficiently automatized and automatically parallelized by modeling the algorithm in GPI-Space using the language of Petri-nets. We demonstrate the potential of our method at the nontrivial example of reducing two-loop five-point nonplanar double-pentagon integrals. We also use GPI-Space to convert the basis of IBP reductions, and discuss the possible simplification of IBP coefficients in a uniformly transcendental basis.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
