Related papers: Planar binary trees in scattering amplitudes
The effective action includes all quantum corrections arising in a given quantum field theory. Thus it serves as a powerful generating functional from which quantum-corrected scattering amplitudes can be constructed via tree-level…
We analyse the singular behaviour of one-loop integrals and scattering amplitudes in the framework of the loop--tree duality approach. We show that there is a partial cancellation of singularities at the loop integrand level among the…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
Categorification of scattering amplitudes for planar Feynman diagrams in scalar field theories with a polynomial potential is reported. Amplitudes for cubic theories are directly written down in terms of projectives of hearts of…
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 introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other…
We consider the theory of spinor fields written in polar form, that is the form in which the spinor components are given in terms of a module times a complex unitary phase respecting Lorentz covariance. In this formalism, spinors can be…
Inspired by the idea of viewing amplitudes in ${\cal N}=4$ SYM as differential forms on momentum twistor space, we introduce differential forms on the space of spinor variables, which combine helicity amplitudes in any four-dimensional…
The group theoretic method is extended to include fields with a background charge. This formalism is used to compute the tree level scattering for $W_3$ strings. The scattering amplitudes involve Ising model correlation functions. A…
We emphasize that scattering amplitudes of a wide class of models to any order in the coupling are constructible by on-shell tree subamplitudes. This follows from the Feynman-tree theorem combined with BCFW on-shell recursion relations. In…
In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…
Motivated by the limited interaction between the mathematical physics community and theoretical physicists - particularly in high-energy theory - we present a computation that is typically the first example in QFT courses but, to our…
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco.
We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e a…
We initiate the study of positive geometry and scattering forms for tree-level amplitudes with matter particles in the (anti-)fundamental representation of the color/flavor group. As a toy example, we study the bi-color scalar theory, which…
This thesis discusses how the pure spinor formalism can be used to efficiently compute superstring scattering amplitudes. We emphasize the pure spinor superspace form of the kinematic factors, where the simplifying features of this language…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
An earlier characterization of topologically ordered (lexicographic) path-length sequences of binary trees is reformulated in terms of an integrality condition on a scaled Kraft sum of certain subsequences (full segments, or islands). The…