Related papers: Efficient Calculation of Crossing Symmetric BCJ Tr…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
The mixings between BMN operators with two scalar impurities and those with a scalar fermion pair are discussed to the lowest order at planar level. For this purpose, matrix model effective vertices are calculated to O(g^3). All the mixing…
Using the ambitwistor string, we compute tree-level celestial amplitudes for biadjoint scalars, Yang-Mills and gravity to all multiplicities. They are presented in compact CHY-like formulas with operator-valued scattering equations and…
Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
The double copy relates scattering amplitudes in gauge and gravity theories. In this paper, we expand the scope of the double copy to construct spacetime metrics through a systematic perturbative expansion. The perturbative procedure is…
A new deterministic, numerical method to solve fermion field theories is presented. This approach is based on finding solutions $Z[J]$ to the lattice functional equations for field theories in the presence of an external source $J$. Using…
We present a new formula for all single trace tree amplitudes in four dimensional super Yang-Mills coupled to Einstein supergravity. Like the Cachazo-He-Yuan formula, our expression is supported on solutions of the scattering equations, but…
The modern scale of data has brought new challenges to Bayesian inference. In particular, conventional MCMC algorithms are computationally very expensive for large data sets. A promising approach to solve this problem is embarrassingly…
We present a new approach to the quantization of the superstring. After a brief review of the classical Green-Schwarz formulation for the superstring and Berkovits' approach to its quantization based on pure spinors, we discuss our…
Corner trees, introduced in "Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of…
By employing the perturbiner method we study the tree- and one-loop-level amplitudes in (anti)self-dual Yang-Mills, focusing on color-kinematics duality and double copy features; they arise naturally even in the fully off-shell case. In…
Balanced search trees are widely used in computer science to efficiently maintain dynamic ordered data. To support efficient set operations (e.g., union, intersection, difference) using trees, the join-based framework is widely studied.…
We develop new mathematical tools for the study of the double copy and colour-kinematics duality for tree-level scattering amplitudes using the properties of Lie polynomials. We show that the $S$-map that was defined to simplify…
Conjunctive queries are the most basic and central class of database queries. With the continued growth of demands to manage and process the massive volume of different types of data, there is little research to study the conjunctive…
We introduce a novel approach for deriving one-loop Bern-Carrasco-Johansson (BCJ) numerators and reveal the worldsheet origin of the one-loop double copy. Our work shows that expanding Cachazo-He-Yuan half-integrands into generalized…
Based on the covariant color-kinematics duality, we investigate combinatorial and algebraic structures underlying their Bern-Carrasco-Johansson (BCJ) numerators of tree-level amplitudes in Yang-Mills-scalar (YMS) theory. The closed-formulae…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
There is evidence that one can compute tree level super Yang-Mills amplitudes using either connected or completely disconnected curves in twistor space. We argue that the two computations are equivalent, if the integration contours are…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…