Papers
Topics
Authors
Recent
Search
2000 character limit reached

Equations for lower bounds on border rank

Published 3 May 2013 in cs.CC and math.AG | (1305.0779v2)

Abstract: We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 in the space of bilinear maps C4 x C4 -> C4. This space of bilinear maps includes the matrix multiplication operator M_2 for two by two matrices. We show these newly obtained polynomials do not vanish on the matrix multiplication operator M_2, which gives a new proof that the border rank of the multiplication of 2 x 2 matrices is seven. Other examples are considered along with an explanation of how to implement the methods.

Citations (28)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.