University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Base sizes of permutation groups

Base sizes of permutation groups

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

If you have a question about this talk, please contact info@newton.ac.uk.

GRAW02 - Computational and algorithmic methods

A base of a permutation group G acting on a set X is a subset of X whose pointwise stabiliser in G is trivial. The base size of G is the minimal cardinality of a base for G. Bases have proved to be very useful, both theoretically (in bounding the order of a primitive permutation group in terms of its degree) and computationally (in many algorithms for permutation groups). Recently, much progress has been made on understanding the base sizes of primitive permutation groups. This talk will survey some of these results.

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