Related papers: Note on graph-based BCJ relation for Berends-Giele…
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study…
In this paper, we have introduced a fundamentally different approach, based on a bottom-up methodology, to expand tree-level Yang-Mills (YM) amplitudes into Yang-Mills-scalar (YMS) amplitudes and Bi-adjoint-scalar (BAS) amplitudes. Our…
Tutte (1961) proved the chain theorem for simple $3$-connected graphs with respect to minors, which states that every simple $3$-connected graph $G$ has a simple $3$-connected minor with one edge fewer than $G$, unless $G$ is a wheel graph.…
Tree-level $n$-point gauge-theory amplitudes with $n-2k$ gluons and $k$ pairs of (massless or massive) particles in the fundamental (or other) representation of the gauge group are invariant under a set of symmetries that act as…
In this note, we derive and interpret hidden zeros of tree-level amplitudes of various theories, including Yang-Mills, non-linear sigma model, special Galileon, Dirac-Born-Infeld, and gravity, by utilizing universal expansions of tree-level…
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…
This article provides an introduction to on-shell recursion relations for calculations of tree-level amplitudes. Starting with the basics, such as spinor notations and color decompositions, we expose analytic properties of gauge-boson…
We find simple expressions for the kinematic numerators of one-loop MHV amplitudes in maximally supersymmetric Yang-Mills theory and supergravity, for any multiplicity. The gauge theory numerators satisfy the Bern-Carrasco-Johansson (BCJ)…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
We translate between different formulations of Yangian invariants relevant for the computation of tree-level scattering amplitudes in N=4 super-Yang--Mills theory. While the R-operator formulation allows to relate scattering amplitudes to…
Modern on-shell S-matrix methods may dramatically improve our understanding of perturbative quantum gravity, but current foundations of on-shell techniques for General Relativity still rely on off-shell Feynman diagram analysis. Here, we…
We propose a new form of the colour-kinematics/double-copy duality for heavy-mass effective field theories, which we apply to construct compact expressions for tree amplitudes with heavy matter particles in Yang-Mills and in gravity to…
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial relation between the treewidth of a graph in the family and…
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…
We consider the connectivity of fiber graphs with respect to Gr\"obner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gr\"obner basis and prove that their edge-connectivity is lowest possible…
Counting the number of spanning trees in specific classes of graphs has attracted increasing attention in recent years. In this note, we present unified proofs and generalizations of several results obtained in the 2020s. The main method is…
Chain graphs combine directed and undirected graphs and their underlying mathematics combines properties of the two. This paper gives a simplified definition of chain graphs based on a hierarchical combination of Bayesian (directed) and…
We show that on-shell recursion relations hold for tree amplitudes in generic two derivative theories of multiple particle species and diverse spins. For example, in a gauge theory coupled to scalars and fermions, any amplitude with at…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…