Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

Authors:
Izumi Miyamoto
Affiliations:
Department of Computer Science, Yamanashi University, 4-3-11 Takeda Kofu 400-8511, Japan
Venue:
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Year:
2000

Citing 0
Cited 4

An improvement of GAP normalizer function for permutation groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A computation of some multiply homogeneous superschemes from transitive permutation groups

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Constructing transitive permutation groups

Journal of Symbolic Computation
An improvement of a function computing normalizers for permutation groups

ICMS'10 Proceedings of the Third international congress conference on Mathematical software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note presents an algorithm to speed up the computation of normalizers of permutation groups. It is an application of computation of isomorphisms of association schemes.