Automatic application of successive asymptotic expansions of Feynman diagrams

TL;DR

This paper presents the EXP program that automates the process of applying successive asymptotic expansions to Feynman diagrams, utilizing recursive algorithms for subgraph generation and topology determination, with practical calculations demonstrated using FORM packages.

Contribution

Introduction of the EXP program that automates asymptotic expansions of Feynman diagrams with recursive algorithms for subgraph and topology analysis.

Findings

Successful automation of asymptotic expansions for Feynman diagrams.

Effective use of recursive algorithms for subgraph generation.

Practical calculations performed with FORM packages MINCER and MATAD.

Abstract

We discuss the program EXP used to automate the successive application of asymptotic expansions to Feynman diagrams. We focus on the generation of the relevant subgraphs and the determination of the topologies for the remaining integrals. Both tasks can be solved by using backtracking-type recursive algorithms. In addition, an application of EXP is presented, where the integrals were calculated using the FORM packages MINCER and MATAD.