pith. sign in

arxiv: hep-lat/0509187 · v4 · submitted 2005-09-30 · ✦ hep-lat · hep-ph· hep-th· math-ph· math.MP

Applying Groebner Bases to Solve Reduction Problems for Feynman Integrals

classification ✦ hep-lat hep-phhep-thmath-phmath.MP
keywords integralsfeynmanreductionbasessolvealgorithmfamilygroebner
0
0 comments X
read the original abstract

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 master integrals. Our approach is based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. We illustrate it through various examples of reduction problems for families of one- and two-loop Feynman integrals. We also solve the reduction problem for a family of integrals contributing to the three-loop static quark potential.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.