University of Cambridge > > Isaac Newton Institute Seminar Series > Algorithms for matrix groups: success, failure, challenge

Algorithms for matrix groups: success, failure, challenge

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

GRA2 - Groups, representations and applications: new perspectives

Many people have worked over the past 30 years to develop and analyse algorithms to provide structural information on matrix groups defined over finite fields. An outcome is that, subject to various assumptions, the composition factors of such a group can now be computed in polynomial time. I will report on some of the problems solved as part of the project, discuss some key unresolved ones, and identify outstanding challenges. 

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