Related papers: Reduction of su(N) loop tensors to trees
We study inferring a tree-structured representation from a single image for object shading. Prior work typically uses the parametric or measured representation to model shading, which is neither interpretable nor easily editable. We propose…
We compute the multiplicity of the irreducible representations in the decomposition of the tensor product of an arbitrary number $n$ of fundamental representations of $SU(N)$, and we identify a duality in the representation content of this…
In Natural Language Processing (NLP), we often need to extract information from tree topology. Sentence structure can be represented via a dependency tree or a constituency tree structure. For this reason, a variant of LSTMs, named…
We design a theoretic tree-based functional representation of a class of Feynman-Kac particle distributions, including an extension of the Wick product formula to interacting particle systems. These weak expansions rely on an original…
We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor…
We propose a set of 4 recurrence relations whose linear combination gives the number of group invariants, equivalently the dimension of the invariant subspace, in the tensor product of an arbitrary number of adjoint representations of the…
We learn sensor trees from training data to minimize sensor acquisition costs during test time. Our system adaptively selects sensors at each stage if necessary to make a confident classification. We pose the problem as empirical risk…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
We advance the recently proposed neuro-symbolic Differentiable Tree Machine, which learns tree operations using a combination of transformers and Tensor Product Representations. We investigate the architecture and propose two key…
Color-ordered amplitudes for the scattering of n particles in the adjoint representation of SU(N) gauge theory satisfy constraints arising solely from group theory. We derive these constraints for n=5 at all loop orders using an iterative…
We propose a color decomposition for general tree amplitudes in a SU(2) gauge theory which is spontaneously broken via the Higgs mechanism. Working in the unitary gauge, we construct color-ordered amplitudes by explicitly presenting a set…
We compute the magnitude (an isometric invariant of metric spaces) of compact $\mathbb{R}$-trees and show that it equals $1 + L/2$, where $L \in [0, \infty]$ denotes the total length. Although length is the only geometric invariant captured…
A systematic loop expansion is formulated in terms of full propagators and vertices. It is based on an expansion of the general solution of an exact non-perturbative flow equation.
We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…
The analysis of contours of scalar fields plays an important role in visualization. For example the contour tree and contour statistics can be used as a means for interaction and filtering or as signatures. In the context of tensor field…
We study Markov tree-shifts given by $k$ transition matrices, one for each of its $k$ directions. We provide a method to characterize the complexity function for these tree-shifts, used to calculate the tree entropies defined by Ban and…
In this paper, we develop a new method to produce explicit formulas for the number $\tau(n)$ of spanning trees in the undirected circulant graphs $C_{n}(s_1,s_2,\ldots,s_k)$ and $C_{2n}(s_1,s_2,\ldots,s_k,n).$ Also, we prove that in both…
We give an introduction to the theory and to some applications of eigenvectors of tensors (in other words, invariant one-dimensional subspaces of homogeneous polynomial maps), including a review of some concepts that are useful for their…
We give a comprehensive review of recent developments on using the pure spinor formalism to compute massless superstring scattering amplitudes at tree level. The main results of the pure spinor computations are placed into the context of…
The All Minors Matrix Tree Theorem states that the determinant of any submatrix of a matrix whose columns sum to zero can be computed as a sum over certain oriented forests. We offer a particularly short proof of this result, which amounts…