Normalisers of primitive permutation groups in quasipolynomial time

02/04/2020

∙

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

Normalisers of primitive permutation groups in quasipolynomial time

Normalizers and permutational isomorphisms in simply-exponential time

Towards Efficient Normalizers of Primitive Groups

Two-closure of rank 3 groups in polynomial time

The central tree property and algorithmic problems on subgroups of free groups

Quasi-automatic semigroups

4-uniform BCT permutations from generalized butterfly structure

Computationally easy, spectrally good multipliers for congruential pseudorandom number generators

Normalisers of primitive permutation groups in quasipolynomial time

Related Research

Normalizers and permutational isomorphisms in simply-exponential time

Towards Efficient Normalizers of Primitive Groups

Two-closure of rank 3 groups in polynomial time

The central tree property and algorithmic problems on subgroups of free groups

Quasi-automatic semigroups

4-uniform BCT permutations from generalized butterfly structure

Computationally easy, spectrally good multipliers for congruential pseudorandom number generators