![]() |
![]() |
![]() Bases for permutation groupsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Chris Parker. Let $G\leqslant\mathrm{Sym}(\Omega)$ be a permutation group on a finite set $\Omega$. A base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser, and the base size of $G$, denoted $b(G)$, is the minimal size of a base for $G$. This classical concept has been studied since the early years of permutation group theory in the nineteenth century, finding a wide range of applications. Recall that $G$ is called primitive if it is transitive and its point stabiliser is a maximal subgroup. Primitive groups can be viewed as the basic building blocks of all finite permutation groups, and much work has been done in recent years in bounding or determining the base sizes of primitive groups. In this talk, I will report on recent progress of this study. In particular, I will give the first family of primitive groups arising in the O’Nan-Scott theorem for which the exact base size has been computed in all cases. 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 listsMet and Mat Seminar Series IMA West Midlands Branch Cold atomsOther talksTBA TBA Gravity wave detection and new findings Plasmonic and photothermal properties of TiN nanomaterials Quantifying the economic and environmental effects of the RCEP Developing coherent light sources from van der Waals heterostructures coupled to plasmonic lattices |