Related papers: Integration-by-parts reductions from unitarity cut…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Recently, a new construction for complete loop integrands of massless field theories has been proposed, with on-shell tree-level amplitudes delicately incorporated into its algorithm. This new approach reinterprets integrands in a novel…
We revisit the idea of numerically integrating the differential form of Feynman integrals. With a novel approach for the treatment of branch cuts, we develop an integrator capable of evaluating a basis of master integrals in double and…
We show how a large class of Feynman integrals can be efficiently reduced to master integrals by suitable covariant differentiation on the vector space dual to the one spanned by the master integrals. The connections needed in the covariant…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Integration by parts identities (IBPs) can be used to express large numbers of apparently different d-dimensional Feynman Integrals in terms of a small subset of so-called master integrals (MIs). Using the IBPs one can moreover show that…
A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…
Extending the method successful for one-loop integrals, the computation of two-loop diagrams with general internal masses is discussed. For the two-loop vertex of non-planar type, as an example, we show a calculation related to…
In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…
At variance with fully inclusive quantities, which have been computed already at the two- or three-loop level, most exclusive observables are still known only at one-loop, as further progress was hampered so far by the greater computational…
We present a systematic method for determining the two-loop effective Lagrangian resulting from integrating out a set of heavy particles in an ultraviolet scalar theory. We prove that the matching coefficients are entirely determined from…
The possibility of treating colour in one-loop amplitude calculations alike the other quantum numbers is briefly discussed for semi-numerical algorithms based on generalized unitarity and parametric integration techniques. Numerical results…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
We present a method to construct a suitable contour deformation in loop momentum space for multi-loop integrals. This contour deformation can be used to perform the integration for multi-loop integrals numerically. The integration can be…
In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be useful in doing so. The first technique is iterative…
In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…
Generalised bi-adjoint scalar amplitudes, obtained from integrations over moduli space of punctured $\mathbb{CP}^{k-1}$, are novel extensions of the CHY formalism. These amplitudes have realisations in terms of Grassmannian cluster…
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…
In this paper, we study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs). Aggregation cuts are obtained as follows: Given an IP formulation, we first generate a…
We propose an efficient linear-time graph-based divisive cluster analysis approach called Reductive Clustering. The approach tries to reveal the hierarchical structural information through reducing the graph into a more concise one…