Basic algorithms in the representation theory of finite groups and algebras

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

• Klaus Lux (University of Arizona)
• Thursday 09 January 2020, 14:00-15:00
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

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.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.