Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Explicit tensors of border rank at least 2n-1 (1209.1664v2)

Published 7 Sep 2012 in cs.CC and math.AG

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

We haven't generated a summary for this paper yet.