Bananas: multi-edge graphs and their Feynman integrals
Dirk Kreimer
TL;DR
The paper develops a recursive, dispersion-based framework for banana graphs $b_n$, expressing the principal-imaginary part $\Im(\Phi_R^D(b_n))$ as an iterated one-dimensional integral built from the seed $\Im(\Phi_R^D(b_2))$ and evolving to $V_n^D$ through $(n-2)$ nested integrals. It analyzes threshold and pseudo-threshold structures, revealing how monodromy and phase-space geometry underpin the integrals, including elliptic behavior in low dimensions (e.g., $b_3$) and more intricate non-elliptic features for higher $n$ (e.g., $b_4$). The work then connects these iterated-integral representations to differential equations, integration-by-parts identities, and master-integral counting, providing both a concrete computational scheme and a geometric interpretation of the master-set size $2^n-1$. Throughout, the authors illustrate how dispersion and iterative integration yield a scalable approach to compute $\Phi_R^D(b_n)$ across dimensions, while highlighting the role of thresholds, pseudo-thresholds, and the algebraic structure arising from successive square-root nestings.
Abstract
We consider multi-edge or banana graphs $b_n$ on $n$ internal edges $e_i$ with different masses $m_i$. We focus on the cut banana graphs $\Im(Φ_R(b_n))$ from which the full result $Φ_R(b_n)$ can be derived through dispersion. We give a recursive definition of $\Im(Φ_R(b_n))$ through iterated integrals. We discuss the structure of this iterated integral in detail. A discussion of accompanying differential equations, of monodromy and of a basis of master integrals is included.
