Base sizes of permutation groups

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

• Joanna Fawcett (Imperial College London)
• Monday 27 January 2020, 14:45-15:35
• Seminar Room 1, Newton Institute.

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

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.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.