THE COMPUTATION OF NORMALIZERS IN PERMUTATION-GROUPS

We describe the theory and implementation of an algorithm for computing the normalizer of a subgroup H of a group G, where G is defined as a finite permutation group. The method consists of a backtrack search through the elements of G, with a considerable number of tests for pruning branches of the search tree. © 1991, Academic Press Limited. All rights reserved.