Campus Event Calendar
Event Entry
What and Who
Multiplicative Complexity of Group Algebras
Alexey Pospelov
Fachrichtung Informatik - Saarbrücken
Talk
AG 1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 9 July 2009
10:15
60 Minutes
E1 3 - CS
415 (4th floor)
Saarbrücken
Abstract
Study of multiplicative complexity of group algebras was motivated by recent work by Cohn et. al., who reduce matrix multiplication to multiplication in group algebras. The idea is that if one finds fast multiplication algorithms for certain group algebras they will yield good upper bound for the matrix exponent.
We start with commutative group algebras over arbitrary fields and prove the universal lower Alder-Strassen bound depending only on the dimension of the algebra and the field characteristic. We also describe all commutative group algebras of minimal multiplicative complexity over arbitrary fields and show some algebras of not minimal rank. Next we prove universal linear upper bound for the bilinear complexity and show some applications for multivariate polynomial multiplication and estimation of the rank of 3x3 matrix multiplication over complex and real fields.
Joint work Bekhan Chokayev.
Contact
Bodo Manthey
5502
--email hidden
passcode not visible
logged in users only
gk-sek, 07/02/2009 10:07
gk-sek, 07/02/2009 09:57 -- Created document.
gk-sek, 07/02/2009 09:57 -- Created document.