Computing Symmetric Normalisers
Group Theory
2023-03-27 v1
Abstract
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to determine the normaliser. A detailed performance test in magma shows the improvement for large examples of intransitive and imprimitive groups.
Cite
@article{arxiv.2303.13734,
title = {Computing Symmetric Normalisers},
author = {Andreas-Stephan Elsenhans},
journal= {arXiv preprint arXiv:2303.13734},
year = {2023}
}