Towards finding hay in a haystack: explicit tensors of border rank greater than in
arXiv:1912.11927
Abstract
We write down an explicit sequence of tensors in , for all sufficiently large, having border rank at least , overcoming a longstanding barrier. We obtain our lower bounds via the border substitution method.
arXiv comment11 pages