相关论文: Efficient Calculation of Crossing Symmetric BCJ Tr…

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

In this short paper, we explore a new way to refactor a simple but tricky-to-parallelize tree-traversal algorithm to harness multicore parallelism. Crucially, the refactoring draws from some classic techniques from programming-languages…

Polar codes under cyclic redundancy check aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes when code lengths are configured to be several kilobits. In order to reduce the decoding…

An off-shell formulation for 6 and 10 dimensions simple supersymmetric Yang-Mills theories is presented. While the fermionic fields couple to left action of S^3 and S^7 respectively, the auxiliary ones couple to right action (and vice…

The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely…

We consider `twin supergravities' - pairs of supergravities with $\mathcal{N}_+$ and $\mathcal{N}_-$ supersymmetries, $\mathcal{N}_+>\mathcal{N}_-$, with identical bosonic sectors - in the context of tensoring super Yang-Mills multiplets.…

Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time solution for Cartesian tree matching, which is based on the KMP…

Recombinant binomial trees are binary trees where each non-leaf node has two child nodes, but adjacent parents share a common child node. Such trees arise in finance when pricing an option. For example, valuation of a European option can be…

We propose a new method for the computation of quantum three-point functions for operators in su(2) sectors of N=4 super Yang-Mills theory. The method is based on the existence of a unitary transformation relating inhomogeneous and…

In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller…

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

We calculate form factors of half-BPS operators in N=4 super Yang-Mills theory at tree level and one loop using novel applications of recursion relations and unitarity. In particular, we determine the expression of the one-loop form factors…

A remarkable connection between BCFW recursion relations and constraints on the S-matrix was made by Benincasa and Cachazo in 0705.4305, who noted that mutual consistency of different BCFW constructions of four-particle amplitudes generates…

We extend the dual algorithm recently described for pure, non-abelian Yang-Mills on the lattice to the case of lattice fermions coupled to Yang-Mills, by constructing an ergodic Metropolis algorithm for dynamic fermions that is local,…

Using the double-copy construction of Yang-Mills-Einstein theories formulated in our earlier work, we obtain compact presentations for single-trace Yang-Mills-Einstein tree amplitudes with up to five external gravitons and an arbitrary…

Building upon the algebraic consistency construction of one-loop Bern-Carrasco-Johansson (BCJ) numerators for Yang-Mills (YM) and Yang-Mills-scalar (YMS) theories, we explore the expansion formula of one-loop Einstein-Yang-Mills (EYM)…

Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…

Binary codes are widely used to represent the data due to their small storage and efficient computation. However, there exists an ambiguity problem that lots of binary codes share the same Hamming distance to a query. To alleviate the…

Existing techniques for Craig interpolation for the quantifier-free fragment of the theory of arrays are inefficient for computing sequence and tree interpolants: the solver needs to run for every partitioning $(A, B)$ of the interpolation…

The problem of {\em efficiently} finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied in literature. However, a closely related problem of efficiently…