REVIEW 1 cited by
Characterization of Decomposition of Matrix Multiplication Tensors
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity theory. In this paper, we characterize existing decompositions (found by any algorithm) by certain vectors called signature, and transform them in another decomposition which can be more suitable in practical algorithms. In particular, we present a novel decomposition of the tensor multiplication of matrices of the size 3x3 with 3x6 with rank 40.
Forward citations
Cited by 1 Pith paper
-
Substitution and quotient of the isotropy group action
A rank-gap criterion on tangent and nullspace matrices turns known solutions of Brent equations into parameterized solution families crossing distinct symmetry orbits, yielding infinitely many inequivalent rational 4×...
Discussion (0). Continue with ORCID to comment.