Centre for the Mathematics of Symmetry and Computation



Hua Zhang


Start date

Submission date


Hua Zhang


Finite primitive groups with soluble stabilizers, with applications in graph theory


In this project we plan to study finite primitive permutation groups whose stabilizers are soluble, such primitive groups are of type affine, almost simple, and product action. For almost simple type, we present an explicit list of such groups and their soluble maximal subgroups. With this explicit list in hand, we are able to study (classify) some symmetric graphs, including edge- primitive s-arc transitive graphs with s>3, and 2-path transitive graphs which are not 2-arc transitive, and more.

Why my research is important

The study of finite primitive permutation groups with soluble stabilizers has a long history. Our research extends some of this earlier work, and it has been proved to be very useful.

Thanks to our research, some special families of symmetric graphs have been completely classified.


Centre for the Mathematics of Symmetry and Computation

This Page

Last updated:
Tuesday, 1 November, 2011 2:52 PM