Files in this item
Computing normalisers of intransitive groups
Item metadata
dc.contributor.author | Chang, Mun See | |
dc.contributor.author | Jefferson, Christopher Anthony | |
dc.contributor.author | Roney-Dougal, Colva Mary | |
dc.date.accessioned | 2022-06-02T10:30:18Z | |
dc.date.available | 2022-06-02T10:30:18Z | |
dc.date.issued | 2022-09-01 | |
dc.identifier | 279392646 | |
dc.identifier | a0c88a80-07d6-4cd5-acd9-f45ab39ee1e3 | |
dc.identifier | 85130335813 | |
dc.identifier | 000807287200001 | |
dc.identifier.citation | Chang , M S , Jefferson , C A & Roney-Dougal , C M 2022 , ' Computing normalisers of intransitive groups ' , Journal of Algebra , vol. 605 , pp. 429-458 . https://doi.org/10.1016/j.jalgebra.2022.05.001 | en |
dc.identifier.issn | 0021-8693 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/114023202 | |
dc.identifier.other | ORCID: /0000-0003-2428-6130/work/114023341 | |
dc.identifier.other | ORCID: /0000-0002-0532-3349/work/114023400 | |
dc.identifier.uri | https://hdl.handle.net/10023/25484 | |
dc.description | Funding: The first and third authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme “Groups, Representations and Applications: New perspectives”, where work on this paper was undertaken. This work was supported by EPSRC grant no EP/R014604/1. This work was also partially supported by a grant from the Simons Foundation. The first and second authors are supported by the Royal Society (RGF\EA\181005 and URF\R\180015). | en |
dc.description.abstract | The normaliser problem takes as input subgroups G and H of the symmetric group Sn, and asks one to compute NG(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=Sn is at least as hard as computing the group of monomial automorphisms of a linear code over any field of fixed prime order. | |
dc.format.extent | 30 | |
dc.format.extent | 1041607 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Algebra | en |
dc.subject | Computational group theory | en |
dc.subject | Backtrack search | en |
dc.subject | Permutation groups | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Computing normalisers of intransitive groups | en |
dc.type | Journal article | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.contributor.institution | University of St Andrews. St Andrews GAP Centre | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | 10.1016/j.jalgebra.2022.05.001 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://doi.org/10.48550/arXiv.2112.00388 | en |
dc.identifier.grantnumber | URF\R\180015 | en |
dc.identifier.grantnumber | RGF\EA\181005 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.