Breaking the 2-loop barrier for generalized IBP reduction

Abstract

We discuss the problem of constructing differential operators for the generalized IBP reduction algorithms at the 2-loop level. A deeply optimized software allows one to efficiently construct such operators for the first non-degenerate 2-loop cases. The most efficient approach is found to be via the so-called partial operators that are much simpler than the complete ones, and that affect the power of only one of the polynomials in the product.

Comments: 17 pages, presented at the Bogolyubov-2019 Conference, 11-13 Sep. 2019, JINR, Dubna, Russia