On the computation of intersection numbers for twisted cocycles
Stefan Weinzierl
TL;DR
Weinzierl develops an extension-free algorithm for computing intersection numbers of twisted cocycles by combining a recursive variable-elimination strategy, pole-order reduction to simple poles, and a univariate global-residue evaluation. The framework relies on twisted cohomology and its dual, with a careful treatment of coefficient equivalence classes and gauge-like transformations to maintain invariance of the final result. The method is demonstrated through univariate and elliptic genus-1 examples, showing exact results without introducing algebraic extensions in intermediate steps, and it is applied to Feynman-integral contexts via the Baikov representation and maximal-cut techniques. The work provides practical tools for faster Feynman integral reductions and for deriving differential equations for master integrals in multivariate settings.
Abstract
Intersection numbers of twisted cocycles arise in mathematics in the field of algebraic geometry. Quite recently, they appeared in physics: Intersection numbers of twisted cocycles define a scalar product on the vector space of Feynman integrals. With this application, the practical and efficient computation of intersection numbers of twisted cocycles becomes a topic of interest. An existing algorithm for the computation of intersection numbers of twisted cocycles requires in intermediate steps the introduction of algebraic extensions (for example square roots), although the final result may be expressed without algebraic extensions. In this article I present an improvement of this algorithm, which avoids algebraic extensions.
