Related papers: Maximal cuts and differential equations for Feynma…
We study a 3-loop 5-propagator Feynman Integral, which we call the vacuum seagull, with arbitrary masses and spacetime dimension using the Symmetries of Feynman Integrals method. It is our first example with potential numerators. We…
Feynman integrals obey linear relations governed by intersection numbers, which act as scalar products between vector spaces. We present a general algorithm for constructing multivariate intersection numbers relevant to Feynman integrals,…
Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally…
A precise calculation of the lepton anomalous magnetic moments (AMM) requires an evaluation of the quantum electrodynamics (QED) Feynman diagrams up to five independent loops. The complicated structure of ultraviolet (UV), infrared (IR) and…
This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…
Finding the ground state of spin glasses is a challenging problem with broad implications. Many hard optimization problems, including NP-complete problems, can be mapped, for instance, to the Ising spin glass model. We present a graph-based…
Different mathematical methods have been applied to obtain the analytic result for the massless triangle Feynman diagram yielding a sum of four linearly independent hypergeometric functions of two variables $F_4$. These are defined for…
We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound paradigm that applies alternating direction method of…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
Using the multivariate residue calculus of Leray, we give a precise definition of the notion of a cut Feynman integral in dimensional regularization, as a residue evaluated on the variety where some of the propagators are put on shell.…
Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as…
We present the analytic calculation of all master integrals for 3-, 4-, and 5-particle semi-inclusive cuts of four-loop massless propagators by means of differential equations. We fix the integration constants by reducing the semi-inclusive…
We recalculate the contributions of individual six loop graphs to the $\beta$-function for a three dimensional scalar theory with an arbitrary sextic scalar potential. Previously this was calculated by Hager who specialised to a theory with…
In a recent paper we have presented an automated subtraction method for divergent multi-loop/leg integrals in dimensional regularisation which allows for their numerical evaluation, and applied it to diagrams with massless internal lines.…
I obtain identities satisfied by the 3-loop self-energy master integrals with four or five propagators with generic masses, including the derivatives with respect to each of the squared masses and the external momentum invariant. These…
Motivated by the precision results in the electroweak theory studies of two-loopFeynman diagrams are performed. Specifically this paper gives a contribution to the knowledge of massive two-loop self-energy diagrams in arbitrary and…
The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We study the conditions under which graphs of certain classes have…
The reduction of Feynman integrals to master integrals is an algebraic problem that requires algorithmic approaches at the modern level of calculations. Straightforward applications of the classical Buchberger algorithm to construct…
An explicit investigation about the equal-mass two-loop sunrise Feynman graph is performed. Such perturbative amplitude is related with many important physical process treated in the standard model context. The background of this…