skip to content
 

A new look at permutation groups of simple diagonal type

Presented by: 
Csaba Schneider
Date: 
Wednesday 5th February 2020 - 16:00 to 17:00
Venue: 
INI Seminar Room 2
Abstract: 
Permutation groups of simple diagonal type form one of the classes of (quasi)primitive permutation groups identified by the O'Nan-Scott Theorem. They also occur among the maximal subgroups of alternating and symmetric groups. Until now, they were not considered as a geometric class in the sense that they were not viewed as stabilizers of geometric or combinatorial objects. In this talk I will report on some new research, carried out in collaboration with Cheryl Praeger, Peter Cameron and Rosemary Bailey, whose results show that these groups can also be viewed as full stabilizers of certain combinatorial structures. I will also show that a permutation group of simple diagonal type is the automorphism group of a graph which is constructed as the edge union of Hamming graphs. The results hold also for infinite permutation groups.




The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons