Fetching the paper…
Reading the bibliography…
For odd n, I write down tensors in C^n\otimes C^n\otimes C^n of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani.
V. Strassen, Rank and optimal computation of generic tensors , Linear Algebra Appl. 52/53
1983
Earlier work this paper cites.
Thomas Lickteig, A note on border rank , Inform. Process. Lett. 18
1984
Earlier work this paper cites.
by same author, Typical tensorial rank , Linear Algebra Appl. 69
1985
Earlier work this paper cites.
B. Griesser, A lower bound for the border rank of a bilinear map , Calcolo 23
1987
Cited alongside, same era.
Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi, Algebraic complexity theory , Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 315, Springer-Verlag, Berlin, 1997, With the collaboration of Thomas Lickteig. MR 99c:68002
1997
Cited alongside, same era.
J. M. Landsberg, New lower bounds for the rank of matrix multiplication , preprint arXiv:1206.1530
Cited in the paper.
Cited in the paper.
Cited in the paper.
Boris Alexeev, Michael Forbes, and Jacob Tsimerman, Tensor rank: some lower and upper bounds , IEEE Conference on Computational Complexity, IEEE Computer Society, Feb 2011, pp. 283–291
2011
Later among the works it cites.
B. Weitz, An improvement on rank of explicit tensors , arXiv 1102.0580 (2011)
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…