Constructing transitive permutation groups

被引:41
作者
Hulpke, A [1 ]
机构
[1] Colorado State Univ, Dept Math, Ft Collins, CO 80523 USA
关键词
computation; permutation group; transitive group; classification;
D O I
10.1016/j.jsc.2004.08.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents a new algorithm to classify all transitive subgroups of the symmetric group up to conjugacy. It has been used to determine the transitive groups of degree up to 30. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 30
页数:30
相关论文
共 46 条
[1]  
[Anonymous], 1982, U SERIES MATH
[2]   Short presentations for finite groups [J].
Babai, L ;
Goodman, AJ ;
Kantor, WM ;
Luks, EM ;
Palfy, PP .
JOURNAL OF ALGEBRA, 1997, 194 (01) :79-112
[3]   The groups of order at most 1000 except 512 and 768 [J].
Besche, HU ;
Eick, B .
JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (04) :405-413
[4]   The Magma algebra system .1. The user language [J].
Bosma, W ;
Cannon, J ;
Playoust, C .
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) :235-265
[5]   THE TRANSITIVE GROUPS OF DEGREE UP TO 11 [J].
BUTLER, G ;
MCKAY, J .
COMMUNICATIONS IN ALGEBRA, 1983, 11 (08) :863-911
[6]   THE TRANSITIVE GROUPS OF DEGREE 14 AND 15 [J].
BUTLER, G .
JOURNAL OF SYMBOLIC COMPUTATION, 1993, 16 (05) :413-422
[7]   Computing maximal subgroups of finite groups [J].
Cannon, J ;
Holt, DF .
JOURNAL OF SYMBOLIC COMPUTATION, 2004, 37 (05) :589-609
[8]   Computing the subgroups of a permutation group [J].
Cannon, JJ ;
Cox, BC ;
Holt, DF .
JOURNAL OF SYMBOLIC COMPUTATION, 2001, 31 (1-2) :149-161
[9]   SOME REMARKS ON THE COMPUTATION OF COMPLEMENTS AND NORMALIZERS IN SOLUBLE GROUPS [J].
CELLER, F ;
NEUBUSER, J ;
WRIGHT, CRB .
ACTA APPLICANDAE MATHEMATICAE, 1990, 21 (1-2) :57-76
[10]  
COLE FN, 1895, Q J PURE APPL MATH, V27, P39