18,328 research outputs found
Effective identifiability criteria for tensors and polynomials
A tensor , in a given tensor space, is said to be -identifiable if it
admits a unique decomposition as a sum of rank one tensors. A criterion for
-identifiability is called effective if it is satisfied in a dense, open
subset of the set of rank tensors. In this paper we give effective
-identifiability criteria for a large class of tensors. We then improve
these criteria for some symmetric tensors. For instance, this allows us to give
a complete set of effective identifiability criteria for ternary quintic
polynomial. Finally, we implement our identifiability algorithms in Macaulay2.Comment: 12 pages. The identifiability criteria are implemented, in Macaulay2,
in the ancillary file Identifiability.m
Cryptography from tensor problems
We describe a new proposal for a trap-door one-way function. The new proposal belongs to the "multivariate quadratic" family but the trap-door is different from existing methods, and is simpler
SOS-Hankel Tensors: Theory and Application
Hankel tensors arise from signal processing and some other applications. SOS
(sum-of-squares) tensors are positive semi-definite symmetric tensors, but not
vice versa. The problem for determining an even order symmetric tensor is an
SOS tensor or not is equivalent to solving a semi-infinite linear programming
problem, which can be done in polynomial time. On the other hand, the problem
for determining an even order symmetric tensor is positive semi-definite or not
is NP-hard. In this paper, we study SOS-Hankel tensors. Currently, there are
two known positive semi-definite Hankel tensor classes: even order complete
Hankel tensors and even order strong Hankel tensors. We show complete Hankel
tensors are strong Hankel tensors, and even order strong Hankel tensors are
SOS-Hankel tensors. We give several examples of positive semi-definite Hankel
tensors, which are not strong Hankel tensors. However, all of them are still
SOS-Hankel tensors. Does there exist a positive semi-definite non-SOS-Hankel
tensor? The answer to this question remains open. If the answer to this
question is no, then the problem for determining an even order Hankel tensor is
positive semi-definite or not is solvable in polynomial-time. An application of
SOS-Hankel tensors to the positive semi-definite tensor completion problem is
discussed. We present an ADMM algorithm for solving this problem. Some
preliminary numerical results on this algorithm are reported
- …