Files in this item
Normalisers of primitive permutation groups in quasipolynomial time
Item metadata
dc.contributor.author | Roney-Dougal, Colva Mary | |
dc.contributor.author | Siccha, Sergio | |
dc.date.accessioned | 2020-06-01T11:30:01Z | |
dc.date.available | 2020-06-01T11:30:01Z | |
dc.date.issued | 2020-04-23 | |
dc.identifier | 266430739 | |
dc.identifier | bea49b5a-f240-47d1-8409-591eaa6d49bc | |
dc.identifier | 85083043001 | |
dc.identifier | 000524292400001 | |
dc.identifier.citation | Roney-Dougal , C M & Siccha , S 2020 , ' Normalisers of primitive permutation groups in quasipolynomial time ' , Bulletin of the London Mathematical Society , vol. 52 , no. 2 , pp. 358-366 . https://doi.org/10.1112/blms.12330 | en |
dc.identifier.issn | 0024-6093 | |
dc.identifier.other | ORCID: /0000-0002-0532-3349/work/75248356 | |
dc.identifier.uri | https://hdl.handle.net/10023/20021 | |
dc.description | Funding: Isaac Newton Institute for Mathematical Sciences for support and hospitality during the programme “Groups, Representations and Applications: New perspectives”, when work on this paper was undertaken. This work was supported by EPSRC grant number EP/R014604/1. | en |
dc.description.abstract | We show that given generators for subgroups G and H of Sn, if G is primitive then generators for NH(G) may be computed in quasipolynomial time, namely 2O(log^3 n). The previous best known bound was simply exponential. | |
dc.format.extent | 277533 | |
dc.language.iso | eng | |
dc.relation.ispartof | Bulletin of the London Mathematical Society | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject | BDC | en |
dc.subject | R2C | en |
dc.subject.lcc | QA | en |
dc.title | Normalisers of primitive permutation groups in quasipolynomial time | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | 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.identifier.doi | 10.1112/blms.12330 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://arxiv.org/abs/2002.01377 | 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.