Abstract

It is a classical theorem of Cayley that every finite group $G$ can be embedded as a subgroup of the permutation group $S_n with n = |G|$. In general, the number n given by Cayley's theorem is not optimal. In this talk, I will discuss minimal permutation representations and explain an "efficient" algorithm to calculate the degree of the minimal permutation representation of a group $G$. This algorithm has surprising consequences that will be explained at the end of the lecture.



Information: