University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Invariable generation of finite classical groups

Invariable generation of finite classical groups

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

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

GRAW02 - Computational and algorithmic methods

We say a group is invariably generated by a subset if it forms a generating set even if an adversary is allowed to replace any elements with their conjugates. Eberhard, Ford and Green built upon the work of many others and showed that, as $n \rightarrow \infty$, the probability that $S_n$ is invariably generated by a random set of elements is bounded away from zero if there are four random elements, but goes to zero if we pick three random elements. This result gives rise to a nice Monte Carlo algorithm for computing Galois groups of polynomials. We will extend this result for $S_n$ to the finite classical groups using the correspondence between classes of maximal tori of classical groups and conjugacy classes of their Weyl groups.

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