Related papers: Summing One-Loop Graphs at Multi-Particle Threshol…
The overall coefficient of the two-loop 4-particle amplitude in superstring theory is determined by making use of the factorization and unitarity. To accomplish this we computed in detail all the relevant tree and one-loop amplitudes…
We show how to simplify the calculation of the finite contributions from heavy particles to EFT Wilson coefficients by using on-shell methods. We apply the technique to the one-loop calculation of $g-2$ and $H\gamma\gamma$, showing how…
We consider a procedure for directly constructing general tree-level four-particle scattering amplitudes of massive spinning particles that are consistent with the usual requirements of Lorentz invariance, unitarity, crossing symmetry, and…
In this paper, we extend the sampling theory on graphs by constructing a framework that exploits the structure in product graphs for efficient sampling and recovery of bandlimited graph signals that lie on them. Product graphs are graphs…
We argue that generic one-loop scattering amplitudes in supersymmetric Yang-Mills theories can be computed equivalently with MHV diagrams or with Feynman diagrams. We first present a general proof of the covariance of one-loop non-MHV…
We establish a connection between tree-level superamplitudes in ABJM theory and leading singularities associated to special three-particle cuts of one-loop superamplitudes where one of the tree amplitudes entering the cut is a four-point…
In this paper we describe algebraic and diagrammatic methods, related to the MHV generating function method, for evaluating and exposing the structure of supersymmetric sums over the states crossing generalized unitarity cuts of multi-loop…
A precise understanding of LHC phenomenology requires the inclusion of one-loop corrections for multi-particle final states. In this talk we describe a semi-numerical method to compute one-loop amplitudes with many external particles and…
We find that different asymptotic measurements in quantum field theory can be related to one another through new versions of crossing symmetry. Assuming analyticity, we conjecture generalized crossing relations for multi-particle processes…
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is drawn centered on v with a radius that is alpha times the…
We use the infrared consistency of one-loop amplitudes in N=4 Yang-Mills theory to derive a compact analytic formula for a tree-level NNMHV gluon scattering amplitude in QCD, the first such formula known. We argue that the IR conditions,…
We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…
We calculate the finite temperature effective potential of $\lambda\phi^4$ at the two loop order of the 2PPI expansion. This expansion contains all diagrams which remain connected when two lines meeting at the same point are cut and…
We investigate the relation between 4d ambitwistor string theory and on-shell diagrams for planar N=4 super-Yang-Mills and N=8 supergravity, and deduce several new results about their scattering amplitudes at tree-level and 1-loop. In…
The idea of adding particles to construct amplitudes has been utilized in various ways in exploring the structure of scattering amplitudes. This idea is often called Inverse Soft Limit, namely it is the reverse mechanism of taking particles…
This article reviews on-shell methods for analytic computation of loop amplitudes, emphasizing techniques based on unitarity cuts. Unitarity techniques are formulated generally but have been especially useful for calculating one-loop…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
The Loop-Tree Duality (LTD) is a novel perturbative method in QFT that establishes a relation between loop-level and tree-level scattering amplitudes. This is achieved by directly applying the Residue Theorem to the loop-energy-integration.…