Related papers: Iteratively Reduce Auxiliary Scalar Product in Mul…
An important aspect of improving perturbative predictions in high energy physics is efficiently reducing dimensionally regularised Feynman integrals through integration by parts (IBP) relations. The well-known triangle rule has been used to…
We introduce a streamlined method for evaluating in-in loop integrals using dimensional regularization for diagrams with an arbitrary number of external legs and vertices, which complements earlier work and facilitates the extraction of the…
The automatic selection of an appropriate time step size has been considered extensively in the literature. However, most of the strategies developed operate under the assumption that the computational cost (per time step) is independent of…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
We give a criterion on collections of Calderon-Zygmund operators to classify product BMO by means of iterated commutators.
We present an algebraic approach to one-loop tensor integral reduction. The integrals are presented in terms of scalar one- to four-point functions. The reduction is worked out explicitly until five-point functions of rank five. The…
This article is the third and last of a series presenting an alternative method to compute the one-loop scalar integrals. It extends the results of first two articles to the infrared divergent case. This novel method enjoys a couple of…
For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…
We show how to extract the coefficients of the 4-, 3-, 2- and 1-point one-loop scalar integrals from the full one-loop amplitude of arbitrary scattering processes. In a similar fashion, also the rational terms can be derived. Basically no…
Structure-preserving linearly implicit exponential integrators are constructed for Hamiltonian partial differential equations with linear constant damping. Linearly implicit integrators are derived by polarizing the polynomial terms of the…
Motivated by the foundational work of Tarasov, who pointed out that the algebraic relations of the type considered here can lead to functional reduction of Feynman integrals, we suitably modify the original method to be able to implement…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
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…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
We describe a new, convenient, recursive tensor integral reduction scheme for one-loop $n$-point Feynman integrals. The reduction is based on the algebraic Davydychev-Tarasov formalism where the tensors are represented by scalars with…
We present a formalism for the calculation of multi-particle one-loop amplitudes, valid for an arbitrary number N of external legs, and for massive as well as massless particles. A new method for the tensor reduction is suggested which…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We construct an explicit family of modular iterated integrals which involves cusp forms. This leads to a new method of producing "invariant versions" of iterated integrals of modular forms. The construction will be based on an extension of…
Empirical evidence reveals existence of partial D-operators for the generalized IBP (BT) reduction algorithms that are, counterintuitively, much simpler and much easier to find than the complete D-operators from the foundational Bernstein…