Related papers: A Symbolic Summation Approach to Feynman Integral …
A method for the evaluation of the epsilon expansion of multi-loop massless Feynman integrals is introduced. This method is based on the Gegenbauer polynomial technique and the expansion of the Gamma function in terms of harmonic sums.…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
We introduce a machine-learning framework based on symbolic regression to extract the full symbol alphabet of multi-loop Feynman integrals. By targeting the analytic structure rather than reduction, the method is broadly applicable and…
We initiate a systematic framework for the analysis of analytic properties of finite Feynman integrals that are multiple polylogarithms. Based on the Feynman parameter representation in complex projective space, we make a complete…
A method for calculating the $1/d$ expansion coefficients for solutions of integration by parts relations for Feynman integrals is presented. The idea is to use linear substitutions to transform these relations to an explicitly recursive…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…
We show that the calculation of L-loop Feynman integrals in D dimensions can be reduced to a series of matrix multiplications in D times L dimensions. This gives rise to a new type of expansions for the critical exponents in three…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
A new powerful method to calculate Feynman diagrams is proposed. It consists in setting up a Taylor series expansion in the external momenta squared (in general multivariable). The Taylor coefficients are obtained from the original diagram…
We develop a new representation for the integrals associated with Feynman diagrams. This leads directly to a novel method for the numerical evaluation of these integrals, which avoids the use of Monte Carlo techniques. Our approach is based…
We determine closed and compact expressions for the epsilon-expansion of certain Gaussian hypergeometric functions expanded around half-integer values by explicitly solving for their recurrence relations. This epsilon-expansion is…
Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to…
Slowly convergent or divergent sequences and series occur abundantly in quantum physics and quantum chemistry. These convergence problems can be overcome with the help of nonlinear sequence transformations (Wynn's epsilon or rho algorithm,…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…