Plethysm and fast matrix multiplication

10/02/2017
by   Tim Seynnaeve, et al.
0

Motivated by the symmetric version of matrix multiplication we study the plethysm S^k(sl_n) of the adjoint representation sl_n of the Lie group SL_n. In particular, we describe the decomposition of this representation into irreducible components for k=3, and find highest weight vectors for all irreducible components. Relations to fast matrix multiplication, in particular the Coppersmith-Winograd tensor are presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2017

A rank 18 Waring decomposition of sM_〈 3〉 with 432 symmetries

The recent discovery that the exponent of matrix multiplication is deter...
research
03/24/2017

Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies

In 1969, V. Strassen improves the classical 2x2 matrix multiplication al...
research
10/29/2022

The isotropy group of the matrix multiplication tensor

By an isotropy group of a tensor t∈ V_1 ⊗ V_2⊗ V_3=V we mean the group o...
research
12/05/2018

Simple, Fast and Practicable Algorithms for Cholesky, LU and QR Decomposition Using Fast Rectangular Matrix Multiplication

This note presents fast Cholesky/LU/QR decomposition algorithms with O(n...
research
11/23/2012

Analysis of a randomized approximation scheme for matrix multiplication

This note gives a simple analysis of a randomized approximation scheme f...
research
05/12/2023

AMULET: Adaptive Matrix-Multiplication-Like Tasks

Many useful tasks in data science and machine learning applications can ...

Please sign up or login with your details

Forgot password? Click here to reset