论文信息 - Computing in Permutation and Ma-trix Groups II: Backtrack Algorithm

Computing in Permutation and Ma-trix Groups II: Backtrack Algorithm

This is the second paper in a series which discusses computation in permutation and matrix groups of very large order. The essential aspects of a backtrack algorithm which searches these groups are presented. We then uniformly describe algorithms for computing centralizers, intersections, and set stabilizers, as well as an algorithm which determines whether two elements are conjugate.

G. Butler

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

[2] James F. Hurley,et al. Finite Simple Groups , 1977 .

[3] Brendan D. McKay,et al. Computing automorphisms and canonical labellings of graphs , 1978 .

[4] Jeffrey S. Leon,et al. An Algorithm for Computing the Automorphism Group of a Hadamard Matrix , 1979, J. Comb. Theory, Ser. A.

[5] Gregory Butler. Computational approaches to certain problems in the theory of finite groups , 1980, Bulletin of the Australian Mathematical Society.

[6] John J. Cannon,et al. Computing in permutation and matrix groups. I. Normal closure, commutator subgroups, series , 1982 .

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