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

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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