论文信息 - The Computation of Normalizers in Permutation Groups

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.

Derek F. Holt

[1] Gregory Butler,et al. Computing in Permutation and Matrix Groups III: Sylow Subgroups , 1989, J. Symb. Comput..

[2] G. Butler. Computing in Permutation and Ma-trix Groups II: Backtrack Algorithm , 1982 .

[3] Gregory Butler,et al. Computing Normalizers in Permutation Groups , 1983, J. Algorithms.

[4] Charles C. Sims,et al. Computation with permutation groups , 1971, SYMSAC '71.