Stabilisers in finite permutation groups
Algebra Seminar
26th November 2024, 4:00 pm – 5:00 pm
Fry Building, 2.04
Let G be a permutation group on the finite set Ω.
One of the most studied topics in permutation group theory is finding a partition of Ω whose stabiliser is trivial.
For example, the base size and the distinguishing number are important notions in this investigation.
In this seminar, we consider a small variation: we fix only the bare minimum (so one subset, or a pair of points) and we do not aim to find a trivial stabiliser, since this would be impossible in general, but to find a stabiliser that has at least some good properties. We will see that this can be done in a few interesting situations.
Organisers: Jack Saunders, Vlad Vankov
Comments are closed.