Related papers: Reduction of su(N) loop tensors to trees
It is a well known result that the number of irreducible representations of SU(N) on a tensor product containing k factors of a vector space V is given by the number of involutions in the symmetric group on k letters. In this paper, we…
In this paper we generalize the $j$-invariant criterion for the semistable reduction type of an elliptic curve to superelliptic curves $X$ given by $y^{n}=f(x)$. We first define a set of tropical invariants for $f(x)$ using symmetrized…
The paper introduces two new aggregation functions to encode structural knowledge from tree-structured data. They leverage the Canonical and Tensor-Train decompositions to yield expressive context aggregation while limiting the number of…
Some invariant tensors in two Naveira classes of Riemannian product manifolds are considered. These tensors are related with natural connections, i.e. linear connections preserving the Riemannian metric and the product structure.
Processing sentence constituency trees in binarised form is a common and popular approach in literature. However, constituency trees are non-binary by nature. The binarisation procedure changes deeply the structure, furthering constituents…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture…
We use reinforcement learning to learn tree-structured neural networks for computing representations of natural language sentences. In contrast with prior work on tree-structured models in which the trees are either provided as input or…
We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…
Building upon the work of Buczy\'nska et al., we study here tensor formats and their corresponding encoding of tensors via two-fold tensor products determined by the combinatorics of a binary tree. The set of all tensors representable by a…
The space of invariants of a tensor product of representations of SL(n) is provided with the basis parametrized by wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris, named here L-tris.
We consider all spanning trees of a complete simple graph $\Gamma$ on $n$ vertices that contain a given $m-$forest $F$. We show that the number of such spanning trees, $\tau(F)$, doesn't depend on the structure of $F$ and is completely…
To facilitate a simultaneous treatment of an arbitrary number of colors in representation theory-based descriptions of QCD color structure, we derive an $N$-independent reduction of SU($N$) tensor products. To this end, we label each…
We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…
In this paper, we define a semi-tensor product for third-order tensors. Based on this definition, we present a new type of tensor decomposition strategy and give the specific algorithm. This decomposition strategy actually generalizes the…
A review is given of a recently developed technique for the analysis of SO(2N) invariant couplings which allows a full exhibition of the SU(N) invariant content of couplings involving the SO(2N) semi-spinors $|\Psi_{\pm}>$ with chiralilty…
Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…
We consider SU(N) lattice gauge theory at infinite N defined on a torus with a CP invariant twist. Massless fermions are incorporated in an elegant way, while keeping them quenched. We present some numerical results which suggest that…