OpenAlex ·

Graph-Based Algorithms for Worldline EFT Integrands

Gregor Kälin and Jungwon Lim

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.35007
Original
Read it at the publisher

Abstract

We present novel graph-centered algorithms for the construction and representation of worldline effective field theory (WEFT) integrands that separate the topological and algebraic structure of loop integrands into independent graph-numerator pairs. In this representation, the graph encodes all propagators, worldline source and sink vertices, momentum routing, i0 prescriptions, and proper-time dependence, while the numerator carries only the minimal algebraic, tensorial content. To construct integrands at fixed post-Minkowskian order we propose a generalized Berends-Giele construction that minimizes the number of expensive tensor contraction operations. We also discuss simplification and canonicalization strategies through "serialization" of worldline propagators and the application of "selfie"-subdiagram partial-fraction identities, yielding a minimal canonical topology basis. We further show that the graph-numerator representation naturally generalizes the notion of an integral family and its sectors, relevant for integration-by-parts (IBP) reduction: propagators are not constrained to a single master labeling, and each sector carries its own minimal set of independent scalar products, completing into an overcomplete global family. This setup minimizes the total number of required integral sectors through an optimal use of sector symmetries and enables independent optimization of propagator labeling for IBP reductions. The algorithms are implemented in the Rust crate FeynRIR, which is currently able to efficiently compute integrands for the variation of the effective WEFT action, the equations of motion for the worldlines and the (radiation-reacted) impulse.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

Get the few papers worth your time every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics