The border rank of the multiplication of 2\times 2 matrices is seven
From MaRDI portal
Publication:3376942
DOI10.1090/S0894-0347-05-00506-0zbMATH Open1088.68069MaRDI QIDQ3376942FDOQ3376942
Authors: J. M. Landsberg 
Publication date: 27 March 2006
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Recommendations
- Equations for lower bounds on border rank
- The border support rank of two-by-two matrix multiplication is seven
- New lower bounds for the border rank of matrix multiplication
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication
Cites Work
- Gaussian elimination is not optimal
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- On multiplication of 2 \(\times\) 2 matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Construction and classification of complex simple Lie algebras via projective geometry
- Rank and optimal computation of generic tensors
- A note on border rank
- Lectures on the complexity of bilinear problems
- Typical tensorial rank
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Approximate Solutions for the Bilinear Form Computational Problem
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Tensor Rank and Border Rank of Band Toeplitz Matrices
- Title not available (Why is that?)
- On the order of approximation in approximative triadic decompositions of tensors
- Border rank of m\(\times n\times (mn-q)\) tensors
- Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues
- A lower bound for the border rank of a bilinear map
- Automata, languages and programming. Seventh Colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980
Cited In (25)
- Geometry and the complexity of matrix multiplication
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
- The border support rank of two-by-two matrix multiplication is seven
- On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
- Numerical stability and tensor nuclear norm
- Tensors in computations
- Ranks derived from multilinear maps
- Classifying entanglement by algebraic geometry
- Effective criteria for specific identifiability of tensors and forms
- Secant varieties of toric varieties
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- Tensor surgery and tensor rank
- An introduction to the computational complexity of matrix multiplication
- The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
- Unifying known lower bounds via geometric complexity theory
- Bounded-rank tensors are defined in bounded degree
- Computing images of polynomial maps
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
- Equations for lower bounds on border rank
- On differences between the border rank and the smoothable rank of a polynomial
- Ideals of bounded rank symmetric tensors are generated in bounded degree
- Tensor rank is not multiplicative under the tensor product
- Induction for secant varieties of Segre varieties
- New lower bounds for matrix multiplication and
- Veldkamp-space aspects of a sequence of nested binary Segre varieties
This page was built for publication: The border rank of the multiplication of $2\times 2$ matrices is seven
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376942)
