Related papers: All orders structure and efficient computation of …
The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method for showing that…
We present an efficient algorithm for calculating multiloop Feynman integrals perturbatively.
In this article, we present the package {\tt Blade} as the first implementation of the block-triangular form improved Feynman integral reduction method. The block-triangular form has orders of magnitude fewer equations compared to the plain…
By introducing an auxiliary parameter, we find a new representation for Feynman integrals, which defines a Feynman integral by analytical continuation of a series containing only vacuum integrals. The new representation therefore…
We present a program that implements the OPP reduction method to extract the coefficients of the one-loop scalar integrals from a user defined (sub)-amplitude or Feynman Diagram, as well as the rational terms coming from the 4-dimensional…
We perform a recursive reduction of one-loop $n$-point rank $R$ tensor Feynman integrals [in short: $(n,R)$-integrals] for $n\leq 6$ with $R\leq n$ by representing $(n,R)$-integrals in terms of $(n,R-1)$- and $(n-1,R-1)$-integrals. We use…
Joint object matching, also known as multi-image matching, namely, the problem of finding consistent partial maps among all pairs of objects within a collection, is a crucial task in many areas of computer vision. This problem subsumes…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them…
The study of Feynman integrals through the lens of intersection theory offers a unifying framework for their analysis, capturing both the linear and quadratic relations that arise among integrals. In doing so, it provides a powerful method…
Implicit Regularization (IReg) is a candidate to become an invariant framework in momentum space to perform Feynman diagram calculations to arbitrary loop order. In this work we present a systematic implementation of our method that…
We introduce a new method to evaluate algebraic integrals over the simplex numerically. This new approach employs techniques from tropical geometry and exceeds the capabilities of existing numerical methods by an order of magnitude. The…
The floor layout problem (FLP) tasks a designer with positioning a collection of rectangular boxes on a fixed floor in such a way that minimizes total communication costs between the components. While several mixed integer programming (MIP)…
Finite Feynman integrals have been advocated as the optimal components for constructing a basis of master integrals in multiloop calculations, due to their improved analytic and numerical properties. In this paper, we show how the Loop-Tree…
For loop integrals, the standard method is reduction. A well-known reduction method for one-loop integrals is the Passarino-Veltman reduction. Inspired by the recent paper [1] where the tadpole reduction coefficients have been solved, in…
We continue our study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we apply the approach of obtaining iteratated solutions to…
Linear programming (LP) relaxations are widely employed in exact solution methods for multilinear programs (MLP). One example is the family of Recursive McCormick Linearization (RML) strategies, where bilinear products are substituted for…
We describe a method to numerically compute multi-loop integrals, depending on one dimensionless parameter $x$ and the dimension $d$, in the whole kinematic range of $x$. The method is based on differential equations, which, however, do not…
We introduce a new technique to optimize a linear cost function subject to a one-dimensional affine homogeneous quadratic integral inequality, i.e., the requirement that a homogeneous quadratic integral functional, affine in the…
A systematic study of the scalar one-loop two-, three-, and four-point Feynman integrals is performed. We consider all cases of mass assignment and external invariants and derive closed expressions in arbitrary space-time dimension in terms…