Related papers: Efficient Calculation of Crossing Symmetric BCJ Tr…
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks…
In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the $d^\text{th}$ order cumulant can be presented in the form of an $d$-dimensional tensor, the algorithm is presented…
We consider the (1,0) supersymmetric Yang-Mills multiplet coupled to a self-dual tensor multiplet in six dimensions. It is shown that the counterterm required to cancel the one-loop gauge anomaly modifies the classical equations of motion…
We consider a scalar function depending on a numerical solution of an initial value problem, and its second-derivative (Hessian) matrix for the initial value. The need to extract the information of the Hessian or to solve a linear system…
We propose a bootstrap program for the {\it form factor squared} with operator ${\rm tr}(\phi^2)$ in maximally supersymmetric Yang-Mills theory in the planar limit, which plays a central role for perturbative calculations of important…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Zernike radial polynomials (ZRP) play a significant role in application areas such as optics design, imaging systems, and image processing systems. Currently, there are two kinds of numerical schemes for computing the ZRP automatically with…
Gray-box optimization leverages the information available about the mathematical structure of an optimization problem to design efficient search operators. Efficient hill climbers and crossover operators have been proposed in the domain of…
Both the Bern, Carrasco and Johansson (BCJ) and the Kawai, Lewellen and Tye (KLT) double-copy formalisms have been recently generalized to a class of scattering matrix elements (so-called form factors) that involve local gauge-invariant…
A merge tree is a topological descriptor of a real-valued function. Merge trees are used in visualization and topological data analysis, either directly or as a means to another end: computing a 0-dimensional persistence diagram,…
We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput. The length-$N$ input sequence is partitioned into $B$ blocks. Processing each block independently of the other…
It has recently been determined that, within the framework of the Exact Renormalisation Group, continuum computations can be performed to any loop order in SU(N) Yang-Mills theory without fixing the gauge or specifying the details of the…
Recent work by Cachazo, He, and Yuan shows that connected prescription residues obey the global identities of $\mathcal{N} = 4$ super-Yang-Mills amplitudes. In particular, they obey the Bern-Carrasco-Johansson (BCJ) amplitude identities.…
In this paper, by treating massive loop momenta to massless momenta in higher dimension, we are able to treat all-loop scattering equations as tree ones. As an application of the new aspect, we consider the CHY-construction of bi-adjoint…
One-loop integrands in Cachazo-He-Yuan (CHY) formula, which is based on the forward limit of tree-level amplitudes, involves linear propagators that are different from quadratic ones in traditional Feynman diagrams. In this paper, we…
Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode…
In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…
We propose a novel local subtraction scheme for the computation of Next-to-Leading Order contributions to theoretical predictions for scattering processes in perturbative Quantum Field Theory. With respect to well known schemes proposed…
This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree…
We report on a systematic perturbative study of three-point functions in planar SU(N) N=4 super Yang-Mills theory at the one-loop level involving scalar field operators up to length five. For this we have computed a sample of 40 structure…