New lower bounds for matrix multiplication and the 3x3 determinant
Abstract
Let denote the matrix multiplication tensor (and write ) and let denote the determinant polynomial considered as a tensor. For a tensor , let denote its border rank. We (i) give the first hand-checkable algebraic proof that ,(ii) prove , and , where previously the only nontrivial matrix multiplication tensor whose border rank had been determined was ,(iii) prove , (iv) prove , improving the previous lower bound of , (v) prove for all (previously only was known) as well as lower bounds for , and (vi) prove for all , where previously only was known, as well as lower boundsfor . Our results utilize a new technique initiated by Buczy\'{n}ska and Buczy\'{n}ski, called border apolarity. The two key ingredients are: (i) the use of a multi-graded ideal associated to a border rank decomposition of any tensor, and (ii) the exploitation of the large symmetry group of to restrict to -invariant ideals, where is a maximal solvable subgroup of the symmetry group of .
Keywords
Cite
@article{arxiv.1911.07981,
title = {New lower bounds for matrix multiplication and the 3x3 determinant},
author = {Austin Conner and Alicia Harper and J. M. Landsberg},
journal= {arXiv preprint arXiv:1911.07981},
year = {2019}
}
Comments
23 pages