We start with a discussion on the connection between the graph isomorphism problem and theory of permutation groups. Then we present the basics of Wielandt’s classical theory connecting permutation groups and invariant relations. Within the framework of this theory, we introduce and study m-equivalent groups (i.e., groups with the same set of invariant relations of arity m). The largest group in the class of m-equivalent groups is defined as the m-closure of any of them. In the second part of the mini-course, we will derive formulas for the m-closure of products of permutation groups, anddiscuss the known algorithms for computing the m-closure. In the last lecture, we will make a short overview of the modern theory of closures of permutation groups and present open problems.
Outline:Lecture 1. Permutation groups and graph isomorphism problem
Lecture 2. Wielandt’s method of invariant relations: the basics
Lecture 3. Products of permutation and matrix groups
Lecture 4. Closures of products of groups
Lecture 5. Classes of groups, invariant with respect to closures I
Lecture 6. Classes of groups, invariant with respect to closures II
Lecture 7. On computing the closures of permutation groups
Lecture 8. New perspectives and open problems
Lectures 1-2,
Lectures 3-4,
Lectures 5-6,
Lectures 7-8