New lower bounds for matrix multiplication and the 3x3 determinant

Abstract

Let M u,v,w∈ Cuv Cvw Cwu denote the matrix multiplication tensor (and write Mn=M n,n,n) and let det3∈ ( C9) 3 denote the determinant polynomial considered as a tensor. For a tensor T, let R(T) denote its border rank. We (i) give the first hand-checkable algebraic proof that R(M2)=7,(ii) prove R(M 223)=10, and R(M 233)=14, where previously the only nontrivial matrix multiplication tensor whose border rank had been determined was M2,(iii) prove R( M3)≥ 17, (iv) prove R( det3)=17, improving the previous lower bound of 12, (v) prove R(M 2nn)≥ n2+1.32n for all n≥ 25 (previously only R(M 2nn)≥ n2+1 was known) as well as lower bounds for 4≤ n≤ 25, and (vi) prove R(M 3nn)≥ n2+2 n+1 for all n≥ 21, where previously only R(M 3nn)≥ n2+2 was known, as well as lower boundsfor 4≤ n≤ 21. Our results utilize a new technique initiated by Buczy\'nska and Buczy\'nski, called border apolarity. The two key ingredients are: (i) the use of a multi-graded ideal associated to a border rank r decomposition of any tensor, and (ii) the exploitation of the large symmetry group of T to restrict to BT-invariant ideals, where BT is a maximal solvable subgroup of the symmetry group of T.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…