Year: 2021
Type: article
Abstract: The normaliser problem has as input two subgroups H and K of the symmetric group $$\mathrm {S}_n$$ S n , and asks for a generating set for $$N_K(H)$$ N K ( H ) : it is not known to have a subexponential time solution. It is proved in Roney-Dougal and Siccha (Bull Lond Math Soc 52(2):358–366, 2020) that if H is primitive, then the normaliser problem can be solved in quasipolynomial time. We show that for all subgroups H and K of $$\mathrm {S}_n$$ S n , in quasipolynomial time, we can decide whether $$N_{\mathrm {S}_n}(H)$$ N S n ( H ) is primitive, and if so, compute $$N_K(H)$$ N K ( H ) . Hence we reduce the question of whether one can solve the normaliser problem in quasipolynomial time to the case where the normaliser in $$\mathrm {S}_n$$ S n is known not to be primitive.
Source: Archiv der Mathematik
Authors: Mun See Chang, Colva M. Roney-Dougal
Institution: University of St Andrews
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,780
Funder: Royal Society
Award: G855632361
OpenAlex ID: W3166555441