University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Constructive recognition of matrix groups

Constructive recognition of matrix groups

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.

GRAW02 - Computational and algorithmic methods

After decades of work by many people, the successes of Matrix Group Recognition Projects and their implementations in the CompositionTree package allow, for the first time, to compute efficiently with large matrix groups (defined over finite fields). A crucial ingredient in those algorithms is the constructive recognition of classical groups. I will survey some of those results and then comment in more detail on my work (with Eamonn O'Brien and Charles Leedham-Green) for finding standard generators in classical groups.

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-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity