![]() |
![]() |
University of Birmingham > Talks@bham > Algebra Seminar > Maximal irredundant base size and relational complexity
Maximal irredundant base size and relational complexityAdd 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. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsMidlands Logic Seminar Human Computer Interaction seminars Applied Mathematics Seminar SeriesOther talksDisorder relevance for non-convex random gradient Gibbs measures in d=2 Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Quantum simulations using ultra cold ytterbium TBC Modelling uncertainty in image analysis. Metamaterials for light-matter interaction studies |