We give constructions of n × n × n tensors of rank at least 2n − O(n). As a corollary we obtain an [n] shaped tensor with rank at least 2n − O(n) when r is odd. The tensors are constructed from a simple recursive pattern, and the lower bounds are proven using a partitioning theorem developed by Brockett and Dobkin. These two bounds are improvements over the… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.