University of Cambridge > > Isaac Newton Institute Seminar Series > A new look at permutation groups of simple diagonal type

A new look at permutation groups of simple diagonal type

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

GRA - Groups, representations and applications: new perspectives

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity