University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Basic algorithms in the representation theory of finite groups and algebras

Basic algorithms in the representation theory of finite groups and algebras

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

GRAW01 - Introductory/instructional workshop

The aim of this talk is an introduction to the basic algorithms in computational representation theory. We will start with the fundamental MeatAxe algorithm for proving the irreducibility of a representation. Based on the MeatAxe one can give algorithmic solutions to more advanced tasks such as determining the endomorphism ring of a representation or the decomposition into a direct sum of indecomposable representations. Finally, we will discuss the condensation method, an important tool used in these applications.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity