• 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
  • Sebastian Jambor
  • (RWTH Aachen)
  • The L_2-quotient and L_3-U_3-quotient algorithms
  • 3pm–4pm, Thursday 29th March, 2012
  • Carslaw 535
  • The L2-quotient algorithm by Plesken and Fabianska finds for a given finitely presented group G all quotients of G which are isomorphic to some finite simple group PSL(2,q), simultaneously for every prime power q. The L3-U3-quotient algorithm does the same for the quotients PSL(3,q) and PSU(3,q).

    After giving a motivation for these algorithms, I will describe the basic ideas which combine methods from representation theory and commutative algebra. At the end, I will try to give a live demonstration of the algorithms with several examples.

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