English

Advanced Computer Algebra Algorithms for the Expansion of Feynman Integrals

Symbolic Computation 2012-10-08 v1 High Energy Physics - Phenomenology High Energy Physics - Theory Mathematical Physics math.MP

Abstract

Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in 4+\ep4+\ep-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter nn. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist--Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in nn. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all nn solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.

Keywords

Cite

@article{arxiv.1210.1685,
  title  = {Advanced Computer Algebra Algorithms for the Expansion of Feynman Integrals},
  author = {J. Ablinger and S. Blümlein and M. Round and C. Schneider},
  journal= {arXiv preprint arXiv:1210.1685},
  year   = {2012}
}

Comments

14 pages, Proceedings, Loops and Legs in Quantum Field Theory 2012, Wernigerode,D; PoS(2012)

R2 v1 2026-06-21T22:16:48.644Z