Normalisers of primitive permutation groups in quasipolynomial time

Abstract

We show that given generators for subgroups $G$ and $H$ of ${\mathrm{S}}_n$, if $G$ is primitive then generators for ${\mathrm{N}}_H(G)$ may be computed in quasipolynomial time, namely $2^{O({\log }^{3}n)}$. The previous best known bound was simply exponential.

arXiv comment11 pages

References in corpus (1)

• A proof of Pyber's base size conjecture

Cited by in corpus (2)

• Computing normalisers of intransitive groups
• Primitive normalisers in quasipolynomial time