Border Ranks of Positive and Invariant Tensor Decompositions

It often is much easier to represent a tensor when allowing an approximation error, even if this error is arbitrarily small. This leads to the notion of a border rank. In this paper, we show that this is also true when considering positive and invariant tensor decompositions. (arXiv:2304.13478)