eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2020-08-18
17:1
17:15
10.4230/LIPIcs.MFCS.2020.17
article
Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras
Bläser, Markus
1
Lysikov, Vladimir
2
https://orcid.org/0000-0002-7816-6524
Saarland University, Saarland Informatics Campus, Saarbrücken, Germany
QMATH, Department of Mathematical Sciences, University of Copenhagen, Denmark
Determining the exponent of matrix multiplication ω is one of the central open problems in algebraic complexity theory. All approaches to design fast matrix multiplication algorithms follow the following general pattern: We start with one "efficient" tensor T of fixed size and then we use a way to get a large matrix multiplication out of a large tensor power of T. In the recent years, several so-called barrier results have been established. A barrier result shows a lower bound on the best upper bound for the exponent of matrix multiplication that can be obtained by a certain restriction starting with a certain tensor.
We prove the following barrier over C: Starting with a tensor of minimal border rank satisfying a certain genericity condition, except for the diagonal tensor, it is impossible to prove ω = 2 using arbitrary restrictions. This is astonishing since the tensors of minimal border rank look like the most natural candidates for designing fast matrix multiplication algorithms. We prove this by showing that all of these tensors are irreversible, using a structural characterisation of these tensors. To obtain our result, we relate irreversibility to asymptotic slice rank and instability of tensors and prove that the instability of block tensors can often be decided by looking only on the sizes of nonzero blocks.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol170-mfcs2020/LIPIcs.MFCS.2020.17/LIPIcs.MFCS.2020.17.pdf
Tensors
Slice rank
Barriers
Matrix multiplication
GIT stability