Related papers: Graphs, determinants and gravity amplitudes
Recently a new recursion relation for tree-level gluon amplitudes in gauge theory has been discovered. We solve this recursion to obtain explicit formulas for the closed set of amplitudes with arbitrarily many positive and negative helicity…
We present all-multiplicity formulae for the tree-level scattering of gluons and gravitons in the maximal helicity violating (MHV) helicity configuration, calculated in certain chiral strong fields. The strong backgrounds we consider are…
We study the three-particle and four-particle scattering amplitudes for an arbitrary, finite number of massive scalars, spinors and vectors by employing the on-shell massive spinor formalism. We consider the most general three-particle…
We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…
A formulation of Einstein gravity, analogous to that for gauge theory arising from the Chalmers-Siegel action, leads to a perturbation theory about an asymmetric weak coupling limit that treats positive and negative helicities differently.…
The monodromy relations in string theory provide a powerful and elegant formalism to understand some of the deepest properties of tree-level field theory amplitudes, like the color-kinematics duality. This duality has been instrumental in…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
Recently, tree-level recursion relations for scattering amplitudes of gluons in Yang-Mills theory have been derived. In this note we propose a generalization of the recursion relations to tree-level scattering amplitudes of gravitons. We…
In arXiv:1707.06803 we derived the subleading multiple soft graviton theorem in a generic quantum theory of gravity for arbitrary number of soft external gravitons and arbitrary number of finite energy external states carrying arbitrary…
We provide a systematic method to compute tree-level scattering amplitudes with spinning external states from amplitudes with scalar external states in arbitrary spacetime dimensions. We write down analytic answers for various scattering…
Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
We derive the subleading soft graviton theorem in a generic quantum theory of gravity for arbitrary number of soft external gravitons and arbitrary number of finite energy external states carrying arbitrary mass and spin. Our results are…
Hyperbolicity is a property of a graph that may be viewed as being a "soft" version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic…
If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…
We present and prove a formula for the MHV scattering amplitude of n gravitons at tree level. Some of the more interesting features of the formula, which set it apart as being significantly different from many more familiar formulas,…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
We discuss the computational complexity of the perturbative evaluation of scattering amplitudes, both by the Caravaglios-Moretti algorithm and by direct evaluation of the individual diagrams. For a self-interacting scalar theory, we…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…