Related papers: Integrand-Level Reduction of Loop Amplitudes by Co…
Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
We propose a novel solution framework for inverse mixed-integer optimization based on analytic center concepts from interior point methods. We characterize the optimality gap of a given solution, provide structural results, and propose…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
Unitarity cut method has been proved to be very useful in the computation of one-loop integrals. In this paper, we generalize the method to the situation where the powers of propagators in the denominator are larger than one in general. We…
We obtain for the first time the two-loop amplitudes for Higgs plus three gluons in Higgs effective field theory including dimension-seven operators. This provides the S-matrix elements for the top mass corrections for Higgs plus a jet…
A numerical algorithm for studying strongly correlated electron systems is proposed. The groundstate wavefunction is projected out after numerical renormalization procedure in the path integral formalism. The wavefunction is expressed from…
The infrared exponentiation properties of dimensionally-regularized multi-loop scattering amplitudes are typically hidden at the level of the integrand, materializing only after integral evaluation. We address this long-standing problem by…
I describe a method for determining the coefficients of scalar integrals for one-loop amplitudes in quantum field theory. The method is based upon generalized unitarity and the behavior of amplitudes when the free parameters of the cut…
We show how the Implicit Regularization Technique (IRT) can be used for the perturbative renormalization of a simple field theoretical model, generally used as a test theory for new techniques. While IRT has been applied successfully in…
Scattering amplitudes at loop level can be expressed in terms of Feynman integrals. The latter satisfy partial differential equations in the kinematical variables. We argue that a good choice of basis for (multi-)loop integrals can lead to…
We present formulas for the coefficients of 2-, 3-, 4- and 5-point master integrals for one-loop massive amplitudes. The coefficients are derived from unitarity cuts in D dimensions. The input parameters can be read off from any…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
We use the recently developed generalized double-copy procedure to construct an integrand for the five-loop four-point amplitude of N=8 supergravity. This construction starts from a naive double copy of the previously computed corresponding…
In this work, we present an algorithm for the diagonalization of the Integration-by-Parts (IBP) equations. Diagonalized IBP equations are indispensable for reducing loop integrals with high numerator powers to master integrals and for…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
Given an affine algebra $R=K[x_1,\dots,x_n]/I$ over a field $K$, where $I$ is an ideal in the polynomial ring $P=K[x_1,\dots,x_n]$, we examine the task of effectively calculating re-embeddings of $I$, i.e., of presentations $R=P'/I'$ such…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A…