A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication

J.M. Landsberg; Mateusz Micha{\l}ek

arxiv: 1608.07486 · v1 · pith:4N5WCWMPnew · submitted 2016-08-26 · 💻 cs.CC · math.AG

A 2n²-log(n)-1 lower bound for the border rank of matrix multiplication

J.M. Landsberg , Mateusz Micha{\l}ek This is my paper

classification 💻 cs.CC math.AG

keywords borderboundlowermatrixmultiplicationrankcombineddenote

0 comments

read the original abstract

Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n.

This paper has not been read by Pith yet.

A 2n²-log(n)-1 lower bound for the border rank of matrix multiplication

discussion (0)