Related papers: Groebner Bases in Perturbative Calculations
Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…
Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…
In this work, we adopt a general framework based on the Gibbs posterior to update belief distributions for inverse problems governed by partial differential equations (PDEs). The Gibbs posterior formulation is a generalization of standard…
We present Groebner.jl, a Julia package for computing Groebner bases with the F4 algorithm. Groebner.jl is an efficient, portable, and open-source software. Groebner.jl works over integers modulo a prime and over the rationals, supports…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
D. Bayer and M. Stillman showed that Grobner bases can be used to compute the Castelnuovo-Mumford regularity, which is a measure for the vanishing of graded local cohomology modules. The aim of this paper is to show that the same method can…
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
A well-established approach to reasoning about loops during program analysis is to capture the effect of a loop by extracting recurrences from the loop; these express relationships between the values of variables, or program properties such…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
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…
We show that to n loop order the divergent content of a Feynman amplitude is spanned by a set of basic (logarithmically divergent) integrals which need not be evaluated. Only the coefficients of the basic divergent integrals are necessary…
Many multi-loop calculations make use of integration by parts relations to reduce the large number of complicated Feynman integrals that arise in such calculations to a simpler basis of master integrals. Recently, Gluza, Kajda, and Kosower…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…
Integration-by-parts reductions play a central role in perturbative QFT calculations. They allow the set of Feynman integrals contributing to a given observable to be reduced to a small set of basis integrals, and they moreover facilitate…