相关论文: Note on graph-based BCJ relation for Berends-Giele…

We review and extend high energy string BCJ relations in both the fixed angle and Regge regimes. We then give an explicit proof of four point string BCJ relations for all energy. This calculation provides an alternative proof of the one…

String monodromy is a set of linear relations among open string tree amplitudes with different orderings of the vertex operators. In this Letter, we show how these intrinsically stringy relations emerge in low-energy effective field theory…

A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…

In this paper, we investigate the $2$-split behavior of tree-level amplitudes of bi-adjoint scalar (BAS), Yang-Mills (YM), non-linear sigma model (NLSM), and general relativity (GR) theories under certain kinematic conditions. Our approach…

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…

The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…

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…

Tree-level amplitudes of gauge theories are expressed in a basis of auxiliary amplitudes with only cubic vertices. The vertices in this formalism are explicitly factorized in color and kinematics, clarifying the color-kinematics duality in…

In this article we consider Bayesian inference for partially observed Andersson-Madigan-Perlman (AMP) Gaussian chain graph (CG) models. Such models are of particular interest in applications such as biological networks and financial time…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…

A remarkable connection between perturbative scattering amplitudes of four-dimensional planar SYM, and the stratification of the positive grassmannian, was revealed in the seminal work of Arkani-Hamed et. al. Similar extension for…

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

Color-factor symmetry is used to derive a KLT-type relation for tree-level QCD amplitudes containing gluons and an arbitrary number of massive or massless quark-antiquark pairs, generalizing the expression for Yang-Mills amplitudes…

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…

This article studies methods to obtain relations for scattering amplitudes at the loop level, with concrete examples at one loop. These methods originate in the analysis of large so-called Britto-Cachazo-Feng-Witten shifts of tree level…

In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…

The relationship between on-shell tree level scattering amplitudes of open and closed strings, discovered some time ago by Kawai, Lewellen and Tye, is used at field theory level (at $O(\alpha'^3)$) to establish a link between the general…

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…

Tree-level amplitudes in N=4 SYM can be decomposed into partial or color-ordered amplitudes. Identities relating various partial amplitudes have been known since the 80's. They are Kleiss-Kuijf (KK) identities. In 2008, Bern, Carrasco and…