Speaker
Description
Abstract:
This is ongoing work on a “package” of procedures to utilise the newly built-in graph generator in FORM. The aim is not to provide a fixed framework, but a modular set of tools intended as a foundation for further user-defined extensions.
The current implementation is tailored to DIS coefficient functions, using graph representations to organise intermediate expressions. The procedures include analysis of graph symmetries, identification of vanishing contributions, and optimisation of momentum routings.
Feynman rules are assigned on top of the generated graph structures, providing a direct bridge between combinatorial graph data and algebraic expressions.
In addition, related procedures for iterated integrals that arise naturally in this context are included.
The emphasis is on flexibility and composability rather than a closed workflow, allowing adaptation to a range of perturbative calculations. While complete packages are often useful, they are not particularly advantageous in state-of-the-art computations where case-by-case optimisation is required.
