Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorRoney-Dougal, Colva Mary
dc.contributor.authorSiccha, Sergio
dc.date.accessioned2020-06-01T11:30:01Z
dc.date.available2020-06-01T11:30:01Z
dc.date.issued2020-04-23
dc.identifier.citationRoney-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.12330en
dc.identifier.issn0024-6093
dc.identifier.otherPURE: 266430739
dc.identifier.otherPURE UUID: bea49b5a-f240-47d1-8409-591eaa6d49bc
dc.identifier.otherORCID: /0000-0002-0532-3349/work/75248356
dc.identifier.otherScopus: 85083043001
dc.identifier.otherWOS: 000524292400001
dc.identifier.urihttps://hdl.handle.net/10023/20021
dc.descriptionFunding: 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.abstractWe 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.language.isoeng
dc.relation.ispartofBulletin of the London Mathematical Societyen
dc.rights© 2020 The Authors. The publishing rights in this article are licensed to the London Mathematical Society under an exclusive licence. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1112/blms.12330en
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subjectBDCen
dc.subjectR2Cen
dc.subject.lccQAen
dc.titleNormalisers of primitive permutation groups in quasipolynomial timeen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.contributor.institutionUniversity of St Andrews. St Andrews GAP Centreen
dc.identifier.doihttps://doi.org/10.1112/blms.12330
dc.description.statusPeer revieweden
dc.identifier.urlhttps://arxiv.org/abs/2002.01377en


This item appears in the following Collection(s)

Show simple item record