Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

Towards finding hay in a haystack: explicit tensors of border rank greater than $2.02m$ in $C^m\otimes C^m\otimes C^m$ (1912.11927v1)

Published 26 Dec 2019 in cs.CC and math.AG

Abstract: We write down an explicit sequence of tensors in $Cm\otimes Cm\otimes Cm$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution method.

Citations (5)

Summary

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