Normalisers of primitive permutation groups in quasipolynomial time
share
We show that given generators for subgroups G and H of S_n, if G is primitive then generators for N_H(G) may be computed in quasipolynomial time, namely 2^O(log^3 n). The previous best known bound was simply exponential.
READ FULL TEXT