An Improvement on Ranks of Explicit Tensors

Details An Improvement on Ranks of Explicit Tensors An Improvement on Ranks of Explicit Tensors

2011-02-02

arxiv.org/abs/1102.0580v2

Computer Science

Discrete Mathematics

Scientific paper

We give constructions of n^k x n^k x n tensors of rank at least 2n^k - O(n^(k-1)). As a corollary we obtain an [n]^r shaped tensor with rank at least 2n^(r/2) - O(n^(r/2)-1) 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 previous best-known explicit tensors that had ranks n^k and n^(r/2) respectively

Affiliated with

Also associated with

No associations

Rating

An Improvement on Ranks of Explicit Tensors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improvement on Ranks of Explicit Tensors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improvement on Ranks of Explicit Tensors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427077