相关论文: Tensor products of coherent configurations

Under the name prime decomposition (pd), a unique decomposition of an arbitrary $N$-dimensional density matrix $\rho$ into a sum of seperable density matrices with dimensions given by the coprime factors of $N$ is introduced. For a class of…

Complicated mathematical equations involving products of tensors with permutation symmetries, frequently encountered in fields such as general relativity and quantum chemistry (e.g., equations in high-order coupled cluster theories),…

This paper discusses the problem of symmetric tensor decomposition on a given variety $X$: decomposing a symmetric tensor into the sum of tensor powers of vectors contained in $X$. In this paper, we first study geometric and algebraic…

Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…

We discuss extended definitions of linear and multilinear operations such as Kronecker, Hadamard, and contracted products, and establish links between them for tensor calculus. Then we introduce effective low-rank tensor approximation…

We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…

We recover the rays in the tensor product of Hilbert spaces within a larger class of so called `states of compoundness', structured as a complete lattice with the `state of separation' as its top element. At the base of the construction…

The method for calculation of the canonical decomposition that approximates a tensor of high order is considered, which requires moderate computational resources. It is based on the replacement of the approximation error norm (global…

Tensor data with rich structural information becomes increasingly important in process modeling, monitoring, and diagnosis. Here structural information is referred to structural properties such as sparsity, smoothness, low-rank, and…

The Candecomp/Parafac (CP) decomposition of the tensor whose maximal dimension is greater than its rank is considered. We derive the upper bound of rank under which the generic uniqueness of CP decomposition is guaranteed. The bound only…

Every finite graph $G$ can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like covering of $G$, whose tangle-tree structure is projected…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…

Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…

It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…

Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…

We give a formula of the connected component decomposition of the Alexander quandle: $\mathbb{Z}[t^{\pm1}]/(f_1(t),\ldots, f_k(t))=\bigsqcup^{a-1}_{i=0}\mathrm{Orb}(i)$, where $a=\gcd (f_1(1),\ldots, f_k(1))$. We show that the connected…

We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…

In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…

It is known that the spatial product of two product systems is intrinsic. Here we extend this result by analyzing subsystems of the tensor product of product systems. A relation with cluster systems is established. In a special case, we…