Computational Algebra Seminar

Computational Algebra Seminar

Colva Roney-Dougal
University Of Sydney

The primitive permutation groups of degree less than 1001

Thursday 14th February, 3:05-4pm

Carslaw 829

I will describe the current work on completing the classification of these permutation groups. We will briefly visit the O'Nan Scott theorem and linger a little longer on Aschbacher's theorem. Then I will describe the techniques that are being used to classify the irreducible subgroups of GL(d, p) for p^d less than 1001. I may finish by presenting some new results.