相关论文: An Algorithm for the Symbolic Reduction of Multi-l…
The method of Symmetries of Feynman Integrals defines for any Feynman diagram a set of partial differential equations. On some locus in parameter space the equations imply that the diagram can be reduced to a linear combination of simpler…
Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…
This work introduces an explicit expression for the generation function for the reduction of an $n$-gon to an $(n-k)$-gon. A novel recursive relation of generation function is formulated based on Feynman Parametrization in projective space,…
In this paper we provide an alternative method to compute correlation functions in the in-in formalism, with a modified set of Feynman rules to compute loop corrections. The diagrammatic expansion is based on an iterative solution of the…
We revisit the idea of numerically integrating the differential form of Feynman integrals. With a novel approach for the treatment of branch cuts, we develop an integrator capable of evaluating a basis of master integrals in double and…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
Building on the idea of numerically integrating differential equations satisfied by Feynman integrals, we propose a novel strategy for handling branch cuts within a numerical framework. We develop an integrator capable of evaluating a basis…
A core challenge for both physics and artificial intellicence (AI) is symbolic regression: finding a symbolic expression that matches data from an unknown function. Although this problem is likely to be NP-hard in principle, functions of…
We describe a new method of calculation of generic multi-loop master integrals based on the numerical solution of systems of difference equations in one variable. We show algorithms for the construction of the systems using…
Integration By Parts (IBP) is an important method for computing Feynman integrals. This work describes a formulation of the theory involving a set of differential equations in parameter space, and especially the definition and study of an…
We present a loop-by-loop method for computing the differential equations of Feynman integrals using the recently developed dual form formalism. We give explicit prescriptions for the loop-by-loop fibration of multi-loop dual forms. Then,…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
We describe how a dlog representation of Feynman integrals leads to simple differential equations. We derive these differential equations directly in loop momentum or embedding space making use of a localization trick and generalized…
New methods for obtaining functional equations for Feynman integrals are presented. Application of these methods for finding functional equations for various one- and two- loop integrals described in detail. It is shown that with the aid of…
In this paper, the reduction of Feynman integrals in the parametric representation is considered. This method proves to be more efficient than the integration-by-part (IBP) method in the momentum space. Tensor integrals can directly be…
We study Feynman integrals in the representation with Schwinger parameters and derive recursive integral formulas for massless 3- and 4-point functions. Properties of analytic (including dimensional) regularization are summarized and we…
We present a new method for the reconstruction of rational functions through finite-fields sampling that can significantly reduce the number of samples required. The method works by exploiting all the independent linear relations among…
We propose a symbolic generative task description language and a corresponding inference engine capable of representing arbitrary multimodal tasks as structured symbolic flows. Unlike conventional generative models that rely on large-scale…
By symbolic summation methods based on difference fields we present a general strategy that transforms definite multi-sums, e.g., in terms of hypergeometric terms and harmonic sums, to indefinite nested sums and products. We succeeded in…
A set of programs is presented for automatically generating and calculating Feynman diagrams. Diagrams are generated with FeynArts, then algebraically simplified using a combination of Mathematica and FORM implemented in the package…