We show that given generators for subgroups G and H of Sn, if G is primitive then generators for NH(G) may be computed in quasipolynomial time, namely 2O(log^3 n). The previous best known bound was simply exponential.<br/
A permutation group is semiprimitive if each normal subgroup is transitive or semiregular. This clas...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractWe describe the theory and implementation of an algorithm for computing the normalizer of a ...
We present a new approach to computing the normaliser of a primitive group G in an arbitrary subgrou...
Funding: The first author is supported by a Royal Society grant (RGF\EA\181005).The normaliser probl...
For two groups $G$ and $H$, which are contained in a common overgroup $K$, we call the \emph{normali...
Given a set r of permutations of an n-set, let G be the group of permutations generated by r. If p i...
Funding: The first and third authors would like to thank the Isaac Newton Institute for Mathematical...
AbstractThis paper describes algorithms for constructing a Hall π-subgroup H of a finite soluble gro...
AbstractLetG,HandEbe subgroups of a finite nilpotent permutation group of degreen. We describe the t...
For a wide family of formations $\mathfrak{F}$ it is proved that the $ \mathfrak{F}$-residual of a p...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
AbstractThe group membership problem for permutation groups is one of the most important problems of...
We prove that the problem of deciding whether or not two group elements are conjugate can be solved ...
A permutation group is semiprimitive if each normal subgroup is transitive or semiregular. This clas...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractWe describe the theory and implementation of an algorithm for computing the normalizer of a ...
We present a new approach to computing the normaliser of a primitive group G in an arbitrary subgrou...
Funding: The first author is supported by a Royal Society grant (RGF\EA\181005).The normaliser probl...
For two groups $G$ and $H$, which are contained in a common overgroup $K$, we call the \emph{normali...
Given a set r of permutations of an n-set, let G be the group of permutations generated by r. If p i...
Funding: The first and third authors would like to thank the Isaac Newton Institute for Mathematical...
AbstractThis paper describes algorithms for constructing a Hall π-subgroup H of a finite soluble gro...
AbstractLetG,HandEbe subgroups of a finite nilpotent permutation group of degreen. We describe the t...
For a wide family of formations $\mathfrak{F}$ it is proved that the $ \mathfrak{F}$-residual of a p...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
AbstractThe group membership problem for permutation groups is one of the most important problems of...
We prove that the problem of deciding whether or not two group elements are conjugate can be solved ...
A permutation group is semiprimitive if each normal subgroup is transitive or semiregular. This clas...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractWe describe the theory and implementation of an algorithm for computing the normalizer of a ...
DOI
Add to ORKG