Show simple item record

Files in this item


Item metadata

dc.contributor.advisorJefferson, Christopher Anthony
dc.contributor.advisorRoney-Dougal, Colva Mary
dc.contributor.authorChang, Mun See
dc.coverage.spatialx, 146 p.en_US
dc.description.abstractWe investigate the normaliser problem, that is, given 𝐺, 𝐻 ≤ 𝑆ₙ, compute 𝑁[sub]𝐺(𝐻). The fastest known theoretical algorithm for this problem is simply exponential, but more efficient algorithms are known for some restriction of classes for 𝐺 and 𝐻. In this thesis, we will focus on highly intransitive groups, which are groups with many orbits. We give new algorithms to compute 𝑁[sub](𝑆ₙ)(𝐻) for highly intransitive groups 𝐻 ≤ 𝑆ₙ and for some subclasses that perform substantially faster than previous implementations in the computer algebra system GAP.en_US
dc.description.sponsorship"This work was supported by the University of St Andrews (School of Computer Science and St Leonard’s College Scholarship)." -- Fundingen
dc.publisherUniversity of St Andrews
dc.relationComputing normalisers of highly intransitive groups (thesis data) Chang, M.S., University of St Andrews, 21 April 2021. DOI:
dc.rightsCreative Commons Attribution-ShareAlike 4.0 International*
dc.subjectPermutation groupsen_US
dc.subjectComputational group theoryen_US
dc.subject.lcshPermutation groupsen
dc.subject.lcshGroup theory--Data processingen
dc.titleComputing normalisers of highly intransitive groupsen_US
dc.contributor.sponsorUniversity of St Andrews. School of Computer Scienceen_US
dc.contributor.sponsorUniversity of St Andrews. St Leonard's Collegeen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US
dc.publisher.departmentCentre for Interdisciplinary Research in Computational Algebra (CIRCA)en_US

The following licence files are associated with this item:

    This item appears in the following Collection(s)

    Show simple item record

    Creative Commons Attribution-ShareAlike 4.0 International
    Except where otherwise noted within the work, this item's licence for re-use is described as Creative Commons Attribution-ShareAlike 4.0 International