Towards finding hay in a haystack: explicit tensors of border rank greater than 2.02m in C^m⊗ C^m⊗ C^m

12/26/2019
by   J. M. Landsberg, et al.
0

We write down an explicit sequence of tensors in C^m⊗ C^m⊗ C^m, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/08/2020

On the geometry of geometric rank

We make a geometric study of the Geometric Rank of tensors recently intr...
research
10/26/2017

Barriers for Rank Methods in Arithmetic Complexity

Arithmetic complexity is considered simpler to understand than Boolean c...
research
01/10/2022

Geometric Rank and Linear Determinantal Varieties

There are close relations between tripartite tensors with bounded geomet...
research
04/08/2019

More barriers for rank methods, via a "numeric to symbolic" transfer

We prove new barrier results in arithmetic complexity theory, showing se...
research
11/13/2018

A geometric study of Strassen's asymptotic rank conjecture and its variants

We establish basic information about the set of tight tensors, the tenso...
research
11/28/2022

Families of Perfect Tensors

Perfect tensors are the tensors corresponding to the absolutely maximall...
research
10/15/2021

New techniques for bounding stabilizer rank

In this work, we present number-theoretic and algebraic-geometric techni...

Please sign up or login with your details

Forgot password? Click here to reset