BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Basic algorithms in the representation theory of finite groups and
  algebras - Klaus Lux (University of Arizona)
DTSTART:20200109T140000Z
DTEND:20200109T150000Z
UID:TALK136552@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:The aim of this talk is an introduction to the basic algorithm
 s in computational representation theory. We will start with the fundament
 al MeatAxe algorithm for proving the irreducibility of a representation. B
 ased on the MeatAxe one can give algorithmic solutions to more advanced ta
 sks such as  determining  the endomorphism ring of a representation or the
  decomposition into a direct sum of indecomposable representations. Finall
 y\, we will discuss the condensation method\,  an important tool  used  in
  these applications.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR