• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Gunter Malle
  • (Universitaet Kassel)
  • Which simple group is it?
  • 3pm–4pm, Thursday 8th March, 2001
  • Carlaw 535
  • 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.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.