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.
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.