University of Birmingham > Talks@bham > Algebra Seminar  > Maximal irredundant base size and relational complexity

Maximal irredundant base size and relational complexity

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

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

We begin with definitions, examples and motivation for various numerical invariants of permutation groups, such as base size, maximal irredundant base size and relational complexity. We then give upper bounds on these numerical invariants for certain families of groups.

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.