5 papers · 1 filter
Generalised sifting in black-box groups
Sophie Ambrose, Max Neunhoeffer, Cheryl E. Praeger +1
We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures fo…
Quasiprimitive groups and blow-up decompositions
Robert W. Baddeley, Cheryl E. Praeger, Csaba Schneider
The blow-up construction by L. G. Kovács has been a very useful tool to study embeddings of finite primitive permutation groups into wreath products in product action. In the prese…
Intransitive Cartesian decompositions preserved by innately transitive permutation groups
Robert W. Baddeley, Cheryl E. Praeger, Csaba Schneider
We study Cartesian decompositions of sets that are acted upon intransitively by innately transitive permutation groups. We prove that such groups have at most three orbits on such…
Three types of inclusions of innately transitive permutation groups into wreath products in product action
Cheryl E. Praeger, Csaba Schneider
A permutation group is innately transitive if it has a transitive minimal normal subgroup, and this subgroup is called a plinth. In this paper we study three special types of inclu…
Innately transitive subgroups of wreath products in product action
Robert W. Baddeley, Cheryl E. Praeger, Csaba Schneider
A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permu…