On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry
DOI10.1137/16M1067457zbMath1365.15034arXiv1601.08229MaRDI QIDQ5347291
Mateusz Michałek, Joseph M. Landsberg
Publication date: 23 May 2017
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.08229
tensornormal formsdeterminantcommuting matricesborder rankmatrix multiplication complexityStrassen's equations
Determinants, permanents, traces, other special matrix functions (15A15) Homogeneous spaces and generalizations (14M17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Real and complex Waring rank of reducible cubic forms
- Geometric aspects of iterated matrix multiplication
- On the third secant variety
- A note on border rank
- On the ranks and border ranks of symmetric tensors
- Rank and optimal computation of generic tensors
- Relations between exact and approximate bilinear algorithms. Applications
- Description de Hilb sup(n) C{X,Y}
- On the complexity of the multiplication of matrices of small formats
- On the projective geometry of rational homogeneous varieties
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Examples of \(k\)-regular maps and interpolation spaces
- Abelian tensors
- Constructions of \(k\)-regular maps using finite local schemes
- On the rank of a symmetric form
- Gaussian elimination is not optimal
- Explicit Tensors
- Determinantal equations for secant varieties and the Eisenbud-Koh-Stillman conjecture
- Local finite-dimensional Gorenstein k-algebras having Hilbert function (1,5,5,1) are smoothable
- The bilinear complexity and practical algorithms for matrix multiplication
- New lower bounds for the border rank of matrix multiplication
- The border rank of the multiplication of $2\times 2$ matrices is seven
- Algebraic geometry and local differential geometry
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- Equations for Lower Bounds on Border Rank
- New Lower Bounds for the Rank of Matrix Multiplication
This page was built for publication: On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry