Related papers: An S-type eigenvalue localization set for tensors
The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…
We are concerned with the eigenstructure of supersymmetric tensors. Like in the matrix case, normalized tensor eigenvectors are fixed points of the tensor power iteration map. However, unless the given tensor is orthogonally decomposable,…
Given a set of prime numbers S, we localise equivariant bivariant Kasparov theory at S and compare this localisation with Kasparov theory by an exact sequence. More precisely, we define the localisation at S to be KK^G(A,B) tensored with…
In applications where the tensor rank decomposition arises, one often relies on its identifiability properties for interpreting the individual rank-$1$ terms appearing in the decomposition. Several criteria for identifiability have been…
We use methods of algebraic geometry to find new, effective methods for detecting the identifiability of symmetric tensors. In particular, for ternary symmetric tensors T of degree 7, we use the analysis of the Hilbert function of a finite…
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 Hankel tensor is called a strong Hankel tensor if the Hankel matrix generated by its generating vector is positive semi-definite. It is known that an even order strong Hankel tensor is a sum-of-squares tensor, and thus a positive…
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this…
For a 4th order 3-dimensional cyclic symmetric tensor, a sufficient and necessary condition is bulit for its positive semi-definiteness. A sufficient and necessary condition of positive definiteness is showed for a 4th order $n$-dimensional…
The covariance tensors in statistics{, elasticity tensor in solid mechanics, Riemann curvature tensor in relativity theory are all biquadratic tensors that are weakly symmetric, but not symmetric in general. Motivated by this, in this…
An algorithm for finding the eigenvalue of a nonnegative irreducible tensor was recently proposed by Michael Ng, Liqun Qi, and Guanglu Zhou in {\it Finding the largest eigenvalue of a nonnegative tensor}. However, the authors did not prove…
We measure electron localization in different materials by means of a ``localization tensor'', based on Berry phases and related quantities. We analyze its properties, and we actually compute such tensor from first principles for several…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposition. This method is based on the computation of maximal singular values and the…
The notion of a Killing tensor is generalised to a superspace setting. Conserved quantities associated with these are defined for superparticles and Poisson brackets are used to define a supersymmetric version of the Schouten-Nijenhuis…
This paper introduces the notion of tubular eigenvalues of third-order tensors with respect to T-products of tensors and analyzes their properties. A focus of the paper is to discuss relations between tubular eigenvalues and two alternative…
This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…
For a 4th order 3-dimensional symmetric tensor with its some entries $1$ or $-1$, we show the analytic sufficient and necessary conditions of its positive definiteness. By applying these conclusions, several strict inequalities is bulit for…
In this paper we generalize the 1-bit matrix completion problem to higher order tensors. We prove that when $r=O(1)$ a bounded rank-$r$, order-$d$ tensor $T$ in $\mathbb{R}^{N} \times \mathbb{R}^{N} \times \cdots \times \mathbb{R}^{N}$ can…
Great advances have been achieved in studying characteristics of entanglement for fundamentals of quantum mechanics and quantum information processing. However, even for N-qubit systems, the problem of entanglement criterion has not been…