相关论文: Identifiability for a class of symmetric tensors

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…

Selecting the latent dimensions (ranks) in tensor factorization is a central challenge that often relies on heuristic methods. This paper introduces a rigorous approach to determine rank identifiability in probabilistic tensor models, based…

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…

The Bel-Robinson tensor is analyzed as a linear map on the space of the traceless symmetric tensors. This study leads to an algebraic classification that refines the usual Petrov-Bel classification of the Weyl tensor. The new classes…

Tensor decompositions have become a central tool in data science, with applications in areas such as data analysis, signal processing, and machine learning. A key property of many tensor decompositions, such as the canonical polyadic…

A spinorial approach to 6-dimensional differential geometry is constructed and used to analyze tensor fields of low rank, with special attention to the Weyl tensor. We perform a study similar to the 4-dimensional case, making full use of…

In this paper, we focus on a special class of symmetric tensors, which can be orthogonally diagonalizable, and investigate their Z-eigenpairs problem. We show that the eigenpairs can be uniformly expressed using several basic eigenpairs,…

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…

Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one…

We present an algorithm aimed to recognize if a given tensor is a non-identifiable rank-3 tensor.

We lay the geometric foundations for the study of the characteristic polynomial of tensors. For symmetric tensors of order $d \geq 3$ and dimension $2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only finitely many…

This paper demonstrates that third-order real symmetric tensors cannot be classified up to equivalence by their eigenvalues only, thereby resolving a problem posed by Qi in 2006. By applying Harrison's center theory, we derive equivalence…

The signature of a path is a sequence of tensors which allows to uniquely reconstruct the path. In this paper we propose a systematic study of basic properties of signature tensors, starting from their rank, symmetries and conciseness. We…

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the…

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

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…

The concept of symmetry breaking has been a propelling force in understanding phases of matter. While rotational symmetry breaking is one of the most prevalent examples, the rich landscape of orientational orders breaking the rotational…

A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary (rank-$1$) skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are…

We prove that a completely symmetric and trace-free rank-4 tensor is, up to sign, a Bel-Robinson type tensor, i.e., the superenergy tensor of a tensor with the same algebraic symmetries as the Weyl tensor, if and only if it satisfies a…

An extension to higher dimensions of the Bel-Debever characterization of the Weyl tensor is considered. This provides algebraic conditions that uniquely determine the multiplicity of a Weyl aligned null direction (WAND), and thus the…