相关论文: Algebraic algorithms for multiloop calculations. T…
We consider Feynman integrals with algebraic leading singularities and total differentials in $\epsilon\,\mathrm{d}\ln$ form. We show for the first time that it is possible to evaluate integrals with singularities involving unrationalizable…
We evaluate the three-loop five-point pentagon-box-box massless integral family in the dimensional regularization scheme, via canonical differential equation. We use tools from computational algebraic geometry to enable the necessary…
We show that for a class of two-loop diagrams, the on-shell part of the integration-by-parts (IBP) relations correspond to exact meromorphic one-forms on algebraic curves. Since it is easy to find such exact meromorphic one-forms from…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
These notes are for the author's lectures, "Integral Reduction and Applied Algebraic Geometry Techniques" in the School and Workshop on Amplitudes in Beijing 2016. I introduce the applications of algebraic geometry methods on multi-loop…
We study the problem of solving integration-by-parts recurrence relations for a given class of Feynman integrals which is characterized by an arbitrary polynomial in the numerator and arbitrary integer powers of propagators, {\it i.e.}, the…
This article is the second of a series of three presenting an alternative method to compute the one-loop scalar integrals. It extends the results of the first article to general complex masses. Let us remind the main features enjoyed by…
We study a recently-proposed approach to the numerical evaluation of multi-loop Feynman integrals using available sector decomposition programs. As our main example, we consider the two-loop integrals for the $\alpha \alpha_s$ corrections…
We present a new algorithm for integration-by-parts (IBP) reduction of Feynman integrals with high powers of numerators or propagators, a demanding computational step in evaluating multi-loop scattering amplitudes. The algorithm allows us…
In this paper we propose some very promissing results in interval arithmetics which permit to build well-defined arithmetics including distributivity of multiplication and division according addition and substraction. Thus, it allows to…
We review the method of the calculation of multiloop integrals recently suggested in Ref.[Lee2010]. A simple method of derivation of the dimensional recurrence relation suitable for automatization is given. Some new analytic results are…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
We derive an analytic representation of the ten-particle, two-loop double-box integral as an elliptic integral over weight-three polylogarithms. To obtain this form, we first derive a four-fold, rational (Feynman-)parametric representation…
In this paper, we propose an orbital iteration based parallel approach for electronic structure calculations. This approach is based on our understanding of the single-particle equations of independent particles that move in an effective…
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…
For the calculation of multi-loop Feynman integrals, a novel numerical method, the Direct Computation Method (DCM) is developed. It is a combination of a numerical integration and a series extrapolation. In principle, DCM can handle…
Recently in arXiv:2012.05599 Rudenko presented a formula for the volume of hyperbolic orthoschemes in terms of alternating polylogarithms. We use this result to provide an explicit analytic result for the one-loop scalar n-gon Feynman…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
Feynman integrals are very often computed from their differential equations. It is not uncommon that the $\varepsilon$-factorised differential equation contains only dlog-forms with algebraic arguments, where the algebraic part is given by…