2000 character limit reached
A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication
Published 26 Aug 2016 in cs.CC and math.AG | (1608.07486v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.