Computing normalisers of highly intransitive groups
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
We investigate the normaliser problem, that is, given 𝐺, 𝐻 ≤ 𝑆ₙ, compute 𝑁[sub]𝐺(𝐻). The fastest known theoretical algorithm for this problem is simply exponential, but more eﬃcient 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.
Thesis, PhD Doctor of Philosophy
Creative Commons Attribution-ShareAlike 4.0 Internationalhttps://creativecommons.org/licenses/by-sa/4.0/
Description of related resourcesComputing normalisers of highly intransitive groups (thesis data) Chang, M.S., University of St Andrews, 21 April 2021. DOI: https://doi.org/10.17630/710dfd8d-356b-4080-b2ad-c6791b7c21fe
Except where otherwise noted within the work, this item's license for re-use is described as Creative Commons Attribution-ShareAlike 4.0 International
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.