相关论文: Minimal Cuts and Genealogical Constraints on Feynm…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
Optimization with orthogonality constraints frequently arises in various fields such as machine learning. Riemannian optimization offers a powerful framework for solving these problems by equipping the constraint set with a Riemannian…
Phylogenetic networks provide a framework for representing evolutionary histories involving reticulate events such as hybridization or horizontal gene transfer. A central problem is to infer such networks from local structural information.…
We introduce two novel numerical approaches for computing Feynman integrals based on their complete monotonicity (CM) and Stieltjes properties. The first method uses that scalar Feynman integrals are CM, meaning that all their derivatives…
We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master…
We present a new formula for the coaction of a large class of integrals. When applied to one-loop (cut) Feynman integrals, it can be given a diagrammatic representation purely in terms of pinches and cuts of the edges of the graph. The…
Integer relation algorithms can convert numerical results for Feynman integrals to exact evaluations, when one has reason to suspect the existence of reductions to linear combinations of a basis, with rational or algebraic coefficients.…
A method for reducing Feynman integrals, depending on several kinematic variables and masses, to a combination of integrals with fewer variables is proposed. The method is based on iterative application of functional equations proposed by…
In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cyclic groups, as a first application, we prove that any subset…
We propose a construction of generalized cuts of Feynman integrals as an operation on the domain of the Feynman parametric integral. A set of on-shell conditions removes the corresponding boundary components of the integration domain, in…
A number of diagrammatic "cutting rules" have recently been developed for the wavefunction of the Universe which determines cosmological correlation functions. These leverage perturbative unitarity to relate particular "discontinuities" in…
Hierarchical clustering seeks to uncover nested structures in data by constructing a tree of clusters, where deeper levels reveal finer-grained relationships. Traditional methods, including linkage approaches, face three major limitations:…
A practical criterion for the irreducibility (with respect to integration by part identities) of a particular Feynman integral to a given set of integrals is presented. The irreducibility is shown to be related to the existence of stable…
Feynman integrals can be expanded asymptotically with respect to some small parameters at the integrand level, a technique known as the expansion by regions. A naive expansion by regions may break down due to divergences not regulated by…
The duality relation between one-loop integrals and phase-space integrals, developed in a previous work, is extended to higher-order loops. The duality relation is realized by a modification of the customary +i0 prescription of the Feynman…
We provide a comprehensive summary of concepts from Calabi-Yau motives relevant to the computation of multi-loop Feynman integrals. From this we derive several consequences for multi-loop integrals in general, and we illustrate them on the…
Scattering amplitudes in quantum field theories have intricate analytic properties as functions of the energies and momenta of the scattered particles. In perturbation theory, their singularities are governed by a set of nonlinear…
Short spanning trees subject to additional constraints are important building blocks in various approximation algorithms. Especially in the context of the Traveling Salesman Problem (TSP), new techniques for finding spanning trees with…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…