University of Birmingham > Talks@bham > Algebra seminar  > On relational complexity and other statistics for permutation groups

On relational complexity and other statistics for permutation groups

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

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

I will discuss some recent work studying various statistics to do with finite permutation groups. These include b(G), minimum base size and RC(G), relational complexity. I will focus mainly on open questions concerning these statistics but will also discuss various bits of joint work with Hudson, Liebeck, Loda and Spiga.

This talk is part of the Algebra seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.