Related papers: Reduction of su(N) loop tensors to trees
We present an algorithm for writing down explicit formulas for all tree amplitudes in N=8 supergravity, obtained from solving the supersymmetric on-shell recursion relations. The formula is patterned after one recently obtained for all tree…
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…
This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…
Based on the decomposition of SU(2) gauge field, we derive a generalization of the decomposition theory for the SU(N) gauge field. We thus obtain the invariant electro-magnetic tensors of SU(N) groups and the extended Wu-Yang potentials.…
Lajos Takacs gave a somewhat formidable alternating sum formula for the number of forests of unrooted trees on $n$ labeled vertices. Here we use a weight-reversing involution on suitable tree configurations to give a combinatorial…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
Invariant tensors are states in the (local) SU(2) tensor product representation but invariant under global SU(2) action. They are of importance in the study of loop quantum gravity. A random tensor is an ensemble of tensor states. An…
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…
We review the recent developments of the loop-tree duality method, focussing our discussion on analysing the singular behaviour of the loop integrand of the dual representation of one-loop integrals and scattering amplitudes. We show that…
In this work a composition-decomposition technique is presented that correlates tree eigenvectors with certain eigenvectors of an associated so-called skeleton forest. In particular, the matching properties of a skeleton determine the…
We define a general product of two $n$-dimensional tensors $\mathbb {A}$ and $\mathbb {B}$ with orders $m\ge 2$ and $k\ge 1$, respectively. This product is a generalization of the usual matrix product, and satisfies the associative law.…
We analyze the decomposition of tensor products between infinite dimensional (unitary) and finite-dimensional (non-unitary) representations of SL(2,R). Using classical results on indefinite inner product spaces, we derive explicit…
We present an algorithm that, on input $n$, lists every unlabeled tree of order $n$.
We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…
Recent advances in Neural Machine Translation (NMT) show that adding syntactic information to NMT systems can improve the quality of their translations. Most existing work utilizes some specific types of linguistically-inspired tree…
This paper studies the issues about tensors. Three typical kinds of tensor decomposition are mentioned. Among these decompositions, the t-SVD is proposed in this decade. Different definitions of rank derive from tensor decompositions. Based…
We study the compressed representation of a ranked tree by a (string) straight-line program (SLP) for its preorder traversal, and compare it with the well-studied representation by straight-line context free tree grammars (which are also…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We introduce and extend the outer product and contractive product of tensors and matrices, and present some identities in terms of these products. We offer tensor expressions of derivatives of tensors, focus on the tensor forms of…
We propose a generalization of meanders, i.e., configurations of non-selfintersecting loops crossing a line through a given number of points, to SU(N). This uses the reformulation of meanders as pairs of reduced elements of the…