The groups of order qn • p

被引：5

作者：

Besche, HU

Eick, B

机构：

[1] Rhein Westfal TH Aachen, Lehrstuhl Math D, D-52064 Aachen, Germany

[2] Univ Kassel, Fachbereich Math, D-34132 Kassel, Germany

来源：

COMMUNICATIONS IN ALGEBRA | 2001年 / 29卷 / 04期

关键词：

D O I：

10.1081/AGB-100002131

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We describe a method to determine up to isomorphism the groups of order q(n .) p for a fixed prime-power q(n) and indeterminate prime p not equal q. We report on the explicit construction of all groups of order 2(n .) p for n less than or equal to 8 and 3(n .) p for n less than or equal to 6. In particular, we show that there are 1 090 235 groups of order 768.

引用

页码：1759 / 1772

页数：14

共 12 条

[1] 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

[2] Construction of finite groups [J].

Besche, HU ;

Eick, B .

JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (04) :387-404

[3]

BESCHE HU, SMALL GROUPS LIB AVA

[4] Enumerating p-groups [J].

Eick, B ;

O'Brien, EA .

JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1999, 67 :191-205

[5]

EICK B, UNPUB COMPUTING AUTO

[6]

EICK B, 1997, DIMACS P GROUPS COMP, P101

[7]

*GAP TEAM, GAP GROUPS ALGORITHM

[8]

Holder O., 1893, MATH ANN, V43, P301, DOI 10.1007/BF01443651

[9]

LAUE R, 1984, P LOND MATH SOC S CO, P105

[10] COMPUTING A SET OF GENERATORS OF MINIMAL CARDINALITY IN A SOLVABLE GROUP [J].

LUCCHINI, A ;

MENEGAZZO, F .

JOURNAL OF SYMBOLIC COMPUTATION, 1994, 17 (05) :409-420

← 1 2 →