arXiv · 2103.12598
Bounds on complexity of matrix multiplication away from CW tensors
Abstract
We present three families of minimal border rank tensors: they come from highest weight vectors, smoothable algebras, or monomial algebras. We analyse them using Strassen's laser method and obtain an upper bound $2.431$ on $\omega$. We also explain how in certain monomial cases using the laser method directly is less profitable than first degenerating. Our results form possible paths in the search for valuable tensors for the laser method away from Coppersmith-Winograd tensors.
Explore related subjects
Keep this discovery
Roser Homs, Joachim Jelisiejew, Mateusz Michałek, Tim Seynnaeve. 2021-03-23. Bounds on complexity of matrix multiplication away from CW tensors. https://arxiv.org/abs/2103.12598
Cite the original work for its findings. Save a collection to share your selection of sources.