AbstractA permutation group is said to be quasiprimitive if each non-trivial normal subgroup is transitive. Finite quasiprimitive permutation groups may be classified into eight types, in a similar fashion to the case division of finite primitive permutation groups provided by the O'Nan–Scott Theorem. The action induced by an imprimitive quasiprimitive permutation group on a non-trivial block system is faithful and quasiprimitive, but may have a different quasiprimitive type from that of the original permutation action. All possibilities for such differences are determined. Suppose that G<H<Sym(Ω) with G, H quasiprimitive and imprimitive. Then for each non-trivial H-invariant partition B of Ω, we have an inclusion GB<HB⩽Sym(B) with HB≅H and...
summary:A solvable primitive group with finitely generated abelian stabilizers is finite
summary:A solvable primitive group with finitely generated abelian stabilizers is finite
In this thesis we extend the classification of primitive permutation groups of degree d to include 4...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
A transitive permutation group G on a finite set Omega is said to be pre-primitive if every G-invari...
A transitive permutation group is called semiprimitive if each normal subgroup is transitive or semi...
AbstractIn this paper, we study the structure of finite permutation groups with a transitive cyclic ...
AbstractThe blow-up construction by L.G. Kovács has been a very useful tool for studying embeddings ...
AbstractA finite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphism...
A permutation group is semiprimitive if each normal subgroup is transitive or semiregular. This clas...
Let G be a transitive permutation group on a set Ω such that, for ω∈Ω, the stabiliser Gω induces on ...
AbstractThe blow-up construction by L.G. Kovács has been a very useful tool for studying embeddings ...
Finite innately transitive permutation groups include all finite quasiprimitive and primitive permut...
AbstractIn this paper, we study the structure of finite permutation groups with a transitive cyclic ...
summary:A solvable primitive group with finitely generated abelian stabilizers is finite
summary:A solvable primitive group with finitely generated abelian stabilizers is finite
In this thesis we extend the classification of primitive permutation groups of degree d to include 4...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
A transitive permutation group G on a finite set Omega is said to be pre-primitive if every G-invari...
A transitive permutation group is called semiprimitive if each normal subgroup is transitive or semi...
AbstractIn this paper, we study the structure of finite permutation groups with a transitive cyclic ...
AbstractThe blow-up construction by L.G. Kovács has been a very useful tool for studying embeddings ...
AbstractA finite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphism...
A permutation group is semiprimitive if each normal subgroup is transitive or semiregular. This clas...
Let G be a transitive permutation group on a set Ω such that, for ω∈Ω, the stabiliser Gω induces on ...
AbstractThe blow-up construction by L.G. Kovács has been a very useful tool for studying embeddings ...
Finite innately transitive permutation groups include all finite quasiprimitive and primitive permut...
AbstractIn this paper, we study the structure of finite permutation groups with a transitive cyclic ...
summary:A solvable primitive group with finitely generated abelian stabilizers is finite
summary:A solvable primitive group with finitely generated abelian stabilizers is finite
In this thesis we extend the classification of primitive permutation groups of degree d to include 4...