Gunter Malle
Universitaet Kassel
Which simple group is it?
Thursday 8th March, 3-4pm
Eastern Avenue Tutorial Room 404
A natural problem in the computational treatment of finite matrix groups
is the recognition of simple groups. That is, given a matrix group G
known to be quasi-simple, determine the isomorphism type of G.
If G is known to be of Lie type in given characteristic p, Babai, Kantor,
Palfy and Serres describe an algorithm to solve this recognition problem.
We report about an implementation of this (joint work with Eamonn O'Brien)
as well as on an approach to guess the right characteristic p.
|