2000 character limit reached
A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication (1608.07486v1)
Published 26 Aug 2016 in cs.CC and math.AG
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 2n2-log(n)-1 for M_n.