REVIEW 1 cited by
Tensor Rank and Complexity
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
Tensor Rank and Complexity
read the original abstract
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will be expressed in terms of tensor (border) rank, (border) symmetric rank and the asymptotic rank of certain tensors. We introduce the multilinear rank of a tensor as well, deal with the concept of tensor equivalence and study prehomogeneous vector spaces with the castling transform. Moreover, we treat Apolarity Theory and use it to determine the symmetric rank (Waring rank) of some symmetric tensors.
Forward citations
Cited by 1 Pith paper
-
Learning words in groups: fusion algebras, tensor ranks and grokking
Group word operations can be learned by small two-layer networks because the associated word tensor has low rank, decomposable through the fusion algebra of the group's self-conjugate representations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.