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$
Published 26 Dec 2019 in cs.CC and math.AG | (1912.11927v1)
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.
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.