2018
DOI: 10.1016/j.cpc.2018.04.012
|View full text |Cite
|
Sign up to set email alerts
|

Kira—A Feynman integral reduction program

Abstract: In this article, we present a new implementation of the Laporta algorithm to reduce scalar multi-loop integrals-appearing in quantum field theoretic calculations-to a set of master integrals. We extend existing approaches by using an additional algorithm based on modular arithmetic to remove linearly dependent equations from the system of equations arising from integration-by-parts and Lorentz identities. Furthermore, the algebraic manipulations required in the back substitution are optimized. We describe in d… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
295
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 347 publications
(297 citation statements)
references
References 50 publications
2
295
0
Order By: Relevance
“…Nevertheless, performing the IBP reduction and accounting for additional identities that originate from the partial fractioning, we find that all diagrams can be expressed in terms of 91 master integrals which are drawn from 19 different topologies, see Table 1. We performed the reduction to master integrals using Reduze [50] and KIRA [51], both of which support the generation and solution of IBPs for Feynman integrals with cut propagators, and we verified that the results of the two reduction codes are equivalent. We use the following notation for the master integrals…”
Section: Matching Coefficientmentioning
confidence: 91%
“…Nevertheless, performing the IBP reduction and accounting for additional identities that originate from the partial fractioning, we find that all diagrams can be expressed in terms of 91 master integrals which are drawn from 19 different topologies, see Table 1. We performed the reduction to master integrals using Reduze [50] and KIRA [51], both of which support the generation and solution of IBPs for Feynman integrals with cut propagators, and we verified that the results of the two reduction codes are equivalent. We use the following notation for the master integrals…”
Section: Matching Coefficientmentioning
confidence: 91%
“…The scalar function f 0 is a function rational in s ij and polynomial in the dimension parameter D, which can be directly reduced using IBP reduction with e.g. public codes [79][80][81][82]. As shown in the r.h.s.…”
Section: Planar Unitarity Cutmentioning
confidence: 99%
“…The algorithm works by imposing an ordering on the different integral families and solving recursively. There exist multiple public and private implementations of this approach [32,[36][37][38][39][40][41], which usually generates a large linear system to be solved.…”
Section: Introductionmentioning
confidence: 99%