Related papers: Real identifiability vs complex identifiability

Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor…

There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank…

Using the tensor identity, we obtain decomposition results for the tensor product of a generalized Verma module with a module $M$ in the category $\mathcal{O}^{\mathfrak{p}}$, based on the decomposition of the restriction of $M$ to the…

We define lower triangular tensors, and show that all diagonal entries of such a tensor are eigenvalues of that tensor. We then define lower triangular sub-symmetric tensors, and show that the number of independent entries of a lower…

Segre-Veronese manifolds are smooth submanifolds of tensors comprising the partially symmetric rank-1 tensors. We investigate a one-parameter family of warped geometries of Segre-Veronese manifolds, which includes the standard Euclidean…

We show that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…

Let E and G be free modules of rank e and g, respectively, over a commutative noetherian ring R. The identity map on E^* tensor G induces the Koszul complex ... -> S_mE^* tensor S_nG tensor Wedge^p(E^* tensor G) -> S_{m+1}E^* tensor…

Let $d \ge 2$ be a positive integer. We show that for a class of notions $R$ of rank for order-$d$ tensors, which includes in particular the tensor rank, the slice rank and the partition rank, there exist functions $F_{d,R}$ and $G_{d,R}$…

Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…

The aim of this note is to obtain results about when the norm of a projective tensor product is strongly subdifferentiable. We prove that if $X\hat{\otimes}_\pi Y$ is strongly subdifferentiable and either $X$ or $Y$ has the metric…

A real binary tensor consists of $2^d$ real entries arranged into hypercube format $2^{\times d}$. For $d=2$, a real binary tensor is a $2\times 2$ matrix with two singular values. Their product is the determinant. We generalize this…

Let $G$ be a graph and $r \ge 1$. A vertex subset is $r$-independent if every connected component of its induced subgraph has size at most $r$. The family of all such subsets forms a simplicial complex, the $r$-independence complex…

Subtracting a critical rank-one approximation from a matrix always results in a matrix with a lower rank. This is not true for tensors in general. Motivated by this, we ask the question: what is the closure of the set of those tensors for…

The set of real matrices of upper-bounded rank is a real algebraic variety called the real generic determinantal variety. An explicit description of the tangent cone to that variety is given in Theorem 3.2 of Schneider and Uschmajew [SIAM…

We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…

Tensor ring (TR) decomposition is an efficient approach to discover the hidden low-rank patterns for higher-order tensors, and streaming tensors are becoming highly prevalent in real-world applications. In this paper, we investigate how to…

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were…

An S-type eigenvalue localization set for a tensor is given by breaking N={1,2,...,n} into disjoint subsets S and its complement. It is shown that the new set is tighter than those provided by L. Qi (Journal of Symbolic Computation 40…

Canonical Polyadic Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. We give an overview of existing results concerning uniqueness. We present new, relaxed, conditions that guarantee…