This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and admits an unexpected symmetry group of order 12. We establish basic information regarding symmetry groups of decompositions and outline two approaches for finding new rank decompositions of $M_{\langle n\rangle}$ for larger $n$
Canonical polyadic decomposition (CPD) of a third-order tensor is decomposition in a minimal number ...
Hitchcock's rank decompositon---also known as the CANDECOMP/PARAFAC tensor decomposition---may be co...
The typical 3-tensorial rank has been much studied over algebraically closed fields, but very little...
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor....
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...
We prove that the rank of the n×n matrix multiplication is at least 3n2 - 2√2n3/2 - 3n. The previous...
AbstractWe study the generic and typical ranks of 3-tensors of dimension l×m×n using results from ma...
AbstractThe problem of obtaining upper bounds on the ranks of third order tensors is studied. New bo...
The exponent of matrix multiplication is the smallest constant o such that two nxn matrices may be...
Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of order n x n ...
Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of order n x n ...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
Canonical polyadic decomposition (CPD) of a third-order tensor is decomposition in a minimal number ...
Hitchcock's rank decompositon---also known as the CANDECOMP/PARAFAC tensor decomposition---may be co...
The typical 3-tensorial rank has been much studied over algebraically closed fields, but very little...
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor....
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...
We prove that the rank of the n×n matrix multiplication is at least 3n2 - 2√2n3/2 - 3n. The previous...
AbstractWe study the generic and typical ranks of 3-tensors of dimension l×m×n using results from ma...
AbstractThe problem of obtaining upper bounds on the ranks of third order tensors is studied. New bo...
The exponent of matrix multiplication is the smallest constant o such that two nxn matrices may be...
Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of order n x n ...
Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of order n x n ...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
Canonical polyadic decomposition (CPD) of a third-order tensor is decomposition in a minimal number ...
Hitchcock's rank decompositon---also known as the CANDECOMP/PARAFAC tensor decomposition---may be co...
The typical 3-tensorial rank has been much studied over algebraically closed fields, but very little...