Computing normalisers of intransitive groups

DOI10.1016/J.JALGEBRA.2022.05.001MaRDI QIDQ6384507arXivFDO

Authors Mun See Chang, Christopher Jefferson, Colva M. Roney-Dougal

Publication date 1 December 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JALGEBRA.2022.05.001

Mathematics Subject Classification ID

Computational methods for problems pertaining to group theory (20-08) Symmetric groups (20B30) Subgroups of symmetric groups (20B35)

arXiv classification

math.GR

Abstract: The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for restricted classes of groups. In this paper, we will focus on groups with many orbits. We give a new algorithm for the normaliser problem for these groups that performs many orders of magnitude faster than previous implementations in GAP. We also prove that the normaliser problem for the special case $G=S_n$ is at least as hard as computing the group of monomial automorphisms of a linear code over any field of fixed prime order.

This page was built for publication: Computing normalisers of intransitive groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6384507)