skip to content

Basic algorithms in the representation theory of finite groups and algebras

Presented by: 
Klaus Lux
Thursday 9th January 2020 - 14:00 to 15:00
INI Seminar Room 1
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.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons