Towards Efficient Normalizers of Primitive Groups
Group Theory
2020-05-12 v1 Symbolic Computation
Abstract
We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation of our algorithm. This article is a collection of results from the author's PhD thesis.
Cite
@article{arxiv.2005.04979,
title = {Towards Efficient Normalizers of Primitive Groups},
author = {Sergio Siccha},
journal= {arXiv preprint arXiv:2005.04979},
year = {2020}
}