Border rank non-additivity for higher order tensors
Algebraic Geometry
2021-04-12 v2 Computational Complexity
Abstract
Whereas matrix rank is additive under direct sum, in 1981 Sch\"onhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive for higher order tensors has remained open. In this work, we settle this problem by providing analogs of Sch\"onhage's construction for tensors of order four and higher. Sch\"onhage's work was motivated by the study of the computational complexity of matrix multiplication; we discuss implications of our results for the asymptotic rank of higher order generalizations of the matrix multiplication tensor.
Keywords
Cite
@article{arxiv.2007.05458,
title = {Border rank non-additivity for higher order tensors},
author = {Matthias Christandl and Fulvio Gesmundo and Mateusz Michałek and Jeroen Zuiddam},
journal= {arXiv preprint arXiv:2007.05458},
year = {2021}
}
Comments
26 pages, 5 figures. Final version accepted in SIMAX