Related papers: Planar binary trees in scattering amplitudes
We study two-to-two scattering amplitudes of a scalar particle of mass $m$. For simplicity, we assume the presence of $\mathbb{Z}_2$ symmetry and that the particle is $\mathbb{Z}_2$ odd. We consider two classes of amplitudes: the fully…
We review the recent developments of the loop-tree duality method, focussing our discussion on analysing the singular behaviour of the loop integrand of the dual representation of one-loop integrals and scattering amplitudes. We show that…
Motivated by the $1/N_c$ expansion, we study a simple model in which the pi-K scattering amplitude is the sum of a current-algebra contact term and resonance pole exchanges. This phenomenological model is crossing symmetric and, when a…
This paper proposes an algebraic view of trees which opens the doors to an alternative computational scheme with respect to classic algorithms. In particular, it is shown that this view is very well-suited for machine learning and…
We introduce new combinatorial objects, the interval- posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear operator that appears in the functional equation of Tamari intervals…
Recently, an explicit, recursive formula for the all-loop integrand of planar scattering amplitudes in N=4 SYM has been described, generalizing the BCFW formula for tree amplitudes, and making manifest the Yangian symmetry of the theory.…
The twistor diagram formalism for scattering amplitudes is introduced, emphasising its finiteness and conformal symmetry. It is shown how MHV amplitudes are simply represented by twistor diagrams. Then the Britto-Cachazo-Feng recursion…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
Asymptotic behavior of the scattering amplitude for two scalar particles by scalar, vector and tensor exchanges at high energy and fixed momentum transfers is reconsidered in quantum field theory. In the framework of the quasi-potential…
The linear $\s$-model is used to study the effects of chiral symmetry in unitarized amplitudes incorporating scalar resonances. When just a single resonance is present, we show that the iteration of a chiral tree amplitude by means of…
We study the extreme local structure of plane binary trees through the distribution of leaves at maximum depth. We first address two basic questions: (i) the asymptotic probability that exactly two leaves occur at the deepest level, and…
We present sparse tree-based and list-based density estimation methods for binary/categorical data. Our density estimation models are higher dimensional analogies to variable bin width histograms. In each leaf of the tree (or list), the…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
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…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube. We introduce tree patterns and…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
The tree-level amplitude for the scattering of two gauge particles constrained to move on the two distinct boundaries of eleven-dimensional space-time in the Horava-Witten formulation of M-theory is constructed. At low momenta this…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…