相关论文: Efficient Calculation of Crossing Symmetric BCJ Tr…
A widely used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure is only concerned with the comparison of labeled trees of two…
Phylogenetically informed k-mers, or phylo-k-mers for short, are k-mers that are predicted to appear within a given genomic region at predefined locations of a fixed phylogeny. Given a reference alignment for this genomic region and…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…
A new approach for tree-level amplitudes with multiple fermion lines is presented. It mainly focuses on the simplification of fermion lines. By calculating two vectors recursively without any matrix multiplications, the result of a fermion…
We present a lagrangian formulation for recently-proposed supersymmetric Yang-Mills theory in twelve dimensions. The field content of our multiplet has an additional auxiliary vector field in the adjoint representation. The usual Yang-Mills…
We discuss the quantum equivalence, to all orders of perturbation theory, between the Yang-Mills theory and its first order formulation through a second rank antisymmetric tensor field. Moreover, the introduction of an additional…
Color/kinematics duality and the double-copy construction have proved to be systematic tools for gaining new insight into gravitational theories. Extending our earlier work, in this paper we introduce new double-copy constructions for large…
By coupling the N=2 spinning particle to background vector fields, we construct Yang-Mills amplitudes for trees and one loop. The vertex operators are derived through coupling the BRST charge; therefore background gauge invariance is…
Dynamic techniques are a scalable and effective way to analyze concurrent programs. Instead of analyzing all behaviors of a program, these techniques detect errors by focusing on a single program execution. Often a crucial step in these…
We present a recursive method for super Yang-Mills color-ordered n-point tree amplitudes based on the cohomology of pure spinor superspace in ten space-time dimensions. The amplitudes are organized into BRST covariant building blocks with…
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…
The multi-scale factor models are particularly appealing for analyzing matrix- or tensor-valued data, due to their adaptiveness to local geometry and intuitive interpretation. However, the reliance on the binary tree for recursive…
Most research on query optimization has centered on binary join algorithms like hash join and sort-merge join. However, recent years have seen growing interest in theoretically optimal algorithms, notably Yannakakis' algorithm. These…
We suggest a new non-recursive algorithm for constructing a binary search tree given an array of numbers. The algorithm has $O(N)$ time and $O(1)$ memory complexity if the given array of $N$ numbers is sorted. The resulting tree is of…
We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut…
The BCJ duality between color and kinematics brings two advantages to calculating multi-loop scattering amplitudes. First the number of ordered cuts that need to be performed to fix the integrand to a gauge theory is minimal -- reducing the…
Computing problems that handle large amounts of data necessitate the use of lossless data compression for efficient storage and transmission. We present a novel lossless universal data compression algorithm that uses parallel computational…
We introduce the idea of constructing recursion operators for full-fledged nonlocal symmetries and apply it to the reduced quasi-classical self-dual Yang-Mills equation. It turns out that the discovered recursion operators can be…
We introduce an algorithm that performs a one-directional mesh overset of a parallel forest of octrees with another distributed mesh of unrelated partition. The forest mesh consists of several adaptively refined octrees. Individual smooth…