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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Base sizes of permutation groups

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

This meeting is online: https://harvard.zoom.us/j/742082644 Center for Mathematical Sciences Engineering Department - Lecture Room - LR6

Other talks

Nature and law Group Work Title to be confirmed Title to be confirmed Cambridge AI in Medicine Seminar - July 2026 What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity