Related papers: Copositivity Detection of Tensors: Theory and Algo…
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…
In particle physics, scalar potentials have to be bounded from below in order for the physics to make sense. The precise expressions of checking lower bound of scalar potentials are essential, which is an analytical expression of checking…
In this paper we discuss copositive tensors, which are a natural generalization of the copositive matrices. We present an analysis of some basic properties of copositive tensors; as well as the conditions under which class of copositive…
In this work, we present a new characterization of symmetric $H^+$-tensors. It is known that a symmetric tensor is an $H^+$-tensor if and only if it is a generalized diagonally dominant tensor with nonnegative diagonal elements. By…
In this paper, we seek analytically checkable necessary and sufficient condition for copositivity of a three-dimensional symmetric tensor. We first show that for a general third order three-dimensional symmetric tensor, this means to solve…
The strict opositivity of 4th order symmetric tensor may apply to detect vacuum stability of general scalar potential. For finding analytical expressions of (strict) opositivity of 4th order symmetric tensor, we may reduce its order to 3rd…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
A real symmetric tensor is orthogonally decomposable (or odeco) if it can be written as a linear combination of symmetric powers of $n$ vectors which form an orthonormal basis of $\mathbb R^n$. Motivated by the spectral theorem for real…
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e., it is a sum of…
Persistent tensors, introduced in [Quantum 8 (2024), 1238], and inspired by quantum information theory, form a recursively defined class of tensors that remain stable under the substitution method and thereby yield nontrivial lower bounds…
In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…
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 multiqubit densities, the tensor of coherences (or Stokes tensor) is a real parameterization obtained by the juxtaposition of the affine Bloch vectors of each qubit. While it maintains the tensorial structure of the underlying space, it…
Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of…
In this paper we study multivariate polynomial functions in complex variables and the corresponding associated symmetric tensor representations. The focus is on finding conditions under which such complex polynomials/tensors always take…
We discuss how recently discovered techniques and tools from compressed sensing can be used in tensor decompositions, with a view towards modeling signals from multiple arrays of multiple sensors. We show that with appropriate bounds on a…
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…
A tensor $T$, in a given tensor space, is said to be $h$-identifiable if it admits a unique decomposition as a sum of $h$ rank one tensors. A criterion for $h$-identifiability is called effective if it is satisfied in a dense, open subset…