Bounds on the tensor rank
classification
🧮 math.AG
math.AC
keywords
tensorcriteriongiveranksufficientableboundbounds
read the original abstract
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and unique.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.