Computing the order of a solvablepermutation group

Journal of Symbolic Computation - Tập 9 - Trang 699-705 - 1990
Charles C. Sims1
1Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA

Tài liệu tham khảo

Babai, 1986, On the length of subgroup chains in symmetric groups, Comm. Algebra, 14, 1729, 10.1080/00927878608823393 Cannon, 1984, A computational toolkit for finite permutation groups, 1 Dixon, 1968, The solvable length of a solvable linear group, Math. Z., 107, 151, 10.1007/BF01111027 Jerrum, 1986, A compact representation for permutation groups, J. Algorith., 7, 60, 10.1016/0196-6774(86)90038-6 Leon, 1980, On an algorithm for finding a base and strong generating set for a group given by generating permutations, Math. Comp., 35, 941, 10.1090/S0025-5718-1980-0572868-5