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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Basic algorithms in the representation theory of finite groups and algebras

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Introduction to Molecular Biology Techniques CMS, Pav.B, CTC Common Room (B1.19). Sociology Seminar Room, CB2 3RQ, Cambridge

Other talks

A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist TBC Early cancer clinical trials Online Causal Inference Seminar John Kendrew Lecture - Title TBC Title TBC
 

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