Permutation group algorithms based on partitions, I: Theory and algorithms
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Polynomial-time normalizers for permutation groups with restricted composition factors
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
An improvement of GAP normalizer function for permutation groups
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
Computation of normalizers for permutation groups is sometimes very hard even if the degrees are small. The author previously obtained some methods to compute normalizers of permutation groups and wrote programs implementing the methods. The programs were mainly applied to groups of small degree such as transitive groups of degree up to 30 in the GAP library. The author will tune up the implementation to speed up the computation of normalizers of permutation groups and apply it to permutation groups of degree up to 100. In our experiments, the normalizers of the primitive groups up to degree 100 and their stabilizers of one point in the symmetric groups are computed.