Papers
Topics
Authors
Recent
Search
2000 character limit reached

Explicit tensors of border rank at least 2n-1

Published 7 Sep 2012 in cs.CC and math.AG | (1209.1664v2)

Abstract: For odd n, I write down tensors in Cn\otimes Cn\otimes Cn of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani. I also study the border rank of the tensors of Alexeev et. al., showing the tensors their tensors T_{2k}, despite having rank equal to 2{k+1}-1, have border rank equal to 2k, the minimum of any concise tensor. I also study the equations of Griesser.

Citations (8)

Summary

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.

Authors (1)

Collections

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