Related papers: A concise proof of Kruskal's theorem on tensor dec…

Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a…

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…

We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition number of $n_1\times n_2 \times 2$ tensors with a random…

Tensor type data are becoming important recently in various application fields. We determine a rank of a tensor T so that A+T is diagonalizable for a given 3-tensor A with 2 slices over the complex and real number field.

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

We present some results on equivariant KK-theory in the context of tensor triangular geometry. More specifically, for G a finite group, we show that the spectrum of the tensor triangulated subcategory of KK^G generated by the tensor unit…

This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which…

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

A symmetric tensor of small rank decomposes into a configuration of only few vectors. We study the variety of tensors for which this configuration is a unit norm tight frame.

In this note, we present an elementary proof of the fact that the slice rank of a trilinear form over a finite field is bounded above by a linear expression in the analytic rank. The existing proofs by Adiprasito-Kazhdan-Ziegler and…

This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic…

A singular $k$-tuple of a tensor $T$ of format $(n_1,\ldots,n_k)$ is essentially a complex critical point of the distance function from $T$ constrained to the cone of tensors of format $(n_1,\ldots,n_k)$ of rank at most one. A generic…

In 2011, Kilmer and Martin proposed tensor singular value decomposition (T-SVD) for third order tensors. Since then, T-SVD has applications in low rank tensor approximation, tensor recovery, multi-view clustering, multi-view feature…

A Cartesian decomposition of a coherent configuration $\cal X$ is defined as a special set of its parabolics that form a Cartesian decomposition of the underlying set. It turns out that every tensor decomposition of $\cal X$ comes from a…

We investigate new lower bounds on the tensor rank of the determinant and the permanent tensors via recursive usage of the Koszul flattening method introduced by Landsberg-Ottaviani and Hauenstein-Oeding-Ottaviani-Sommese. Our lower bounds…

We introduce a broad lemma, one consequence of which is the higher order singular value decomposition (HOSVD) of tensors defined by DeLathauwer, DeMoor and Vandewalle (2000). By an analogous application of the lemma, we find a complex…

We extend a classical result by Derdzinski and Shen, on the restrictions imposed on the Riemann tensor by the existence of a nontrivial Codazzi tensor. The new conditions of the theorem include Codazzi tensors (i.e. closed 1-forms) as well…

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…

In the past few years, the slice-rank lemma of Tao has been applied successfully to many problems in extremal combinatorics. In this paper, first, we define a new notion of triangular tensors which generalizes that of triangular matrices…

Because of the attractiveness of the canonical polyadic (CP) tensor decomposition in various applications, several algorithms have been designed to compute it, but efficient ones are still lacking. Iterative deflation algorithms based on…