Related papers: A New Algorithm For The Generation Of Unitarity-Co…
Feynman integral reduction based on intersection theory provides an alternative to the traditional integration-by-parts method, yet its practical application has been constrained by the large number of variables required in the computation.…
The reduction of Feynman integrals to a basis of linearly independent master integrals is a pivotal step in loop calculations, but also one of the main bottlenecks. In this paper, we assess the impact of using transverse integration…
We propose a novel method to compute multi-loop master integrals by constructing and numerically solving a system of ordinary differential equations, with almost trivial boundary conditions. Thus it can be systematically applied to problems…
The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…
Intersection numbers are rational scalar products among functions that admit suitable integral representations, such as Feynman integrals. Using these scalar products, the decomposition of Feynman integrals into a basis of linearly…
In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by…
We present a new method for computing multi-loop scattering amplitudes in Quantum Field Theory. It extends the Generalized Unitarity method by constraining not only the integrand of the amplitude but also its full integrated form. Our…
We discuss recent progress in multi-loop integrand reduction methods. Motivated by the possibility of an automated construction of multi-loop amplitudes via generalized unitarity cuts we describe a procedure to obtain a general…
Coresets are compact representations of data sets such that models trained on a coreset are provably competitive with models trained on the full data set. As such, they have been successfully used to scale up clustering models to massive…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
Integration-by-parts (IBP) reduction is one of the essential steps in evaluating Feynman integrals. A modern approach to IBP reduction uses modular arithmetic evaluations with parameters set to numerical values at sample points, followed by…
We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…
We investigate a novel theoretical structure underlying the computation of integration-by-parts relations between Feynman integrals via syzygy-based methods. Building on insights from intersection theory, we analyze the large-$\epsilon$…
We calculate all three-loop, five-point, massless planar Feynman integral families in the dimensional regularization scheme. This is a new milestone in Feynman integral computations. The analysis covers four distinct families of Feynman…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
In this paper, we construct a uniform formula that can iteratively reduce all auxiliary scalar product numerators of arbitrary multi-loop Feynman integrals. Integrals with such numerators commonly appear in Integration-By-Parts (IBP)…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
A universal algorithm to construct N-particle (classical and quantum) completely integrable Hamiltonian systems from representations of coalgebras with Casimir element is presented. In particular, this construction shows that quantum…
A powerful approach to computing Feynman integrals or cosmological correlators is to consider them as solution to systems of differential equations. Often these can be chosen to be Gelfand-Kapranov-Zelevinsky (GKZ) systems. However, their…