textabstractThe tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r simple tensors. Let s be a k-tensor and let t be an ℓ-tensor. The tensor product of s and t is a (k+ℓ)-tensor. Tensor rank is sub-multiplicative under the tensor product. We revisit the connection between restrictions and degenerations. A result of our study is that tensor rank is not in general multiplicative under the tensor product. This answers a question of Draisma and Saptharishi. Specifically, if a tensor t has border rank strictly smaller than its rank, then the tensor rank of t is not multiplicative under taking a sufficiently hight tensor product power. The “tensor Kronecker product” from algebraic complexity theory is re...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe main result reads: if a nonsingular matrix A of order n=pq is a tensor-product binomial ...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r s...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combi...
AbstractThe border rank of a nondegenerate m×n×(mn−q) tensor over the complex field is mn−q provided...
Tensor decompositions have been studied for nearly a century, but the well-known notion of tensor ra...
Tensor decompositions have been studied for nearly a century, but the well-known notion of tensor ra...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe main result reads: if a nonsingular matrix A of order n=pq is a tensor-product binomial ...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r s...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combi...
AbstractThe border rank of a nondegenerate m×n×(mn−q) tensor over the complex field is mn−q provided...
Tensor decompositions have been studied for nearly a century, but the well-known notion of tensor ra...
Tensor decompositions have been studied for nearly a century, but the well-known notion of tensor ra...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe main result reads: if a nonsingular matrix A of order n=pq is a tensor-product binomial ...