The construction of finite solvable groups revisited

被引：3
作者：
Eick, Bettina [1 ]
Horn, Max
机构：
[1] Tech Univ Carolo Wilhelmina Braunschweig, Inst Computat Math, AG Algebra & Diskrete Math, D-38106 Braunschweig, Germany
来源：
JOURNAL OF ALGEBRA | 2014年 / 408卷
关键词：
Finite solvable groups; Extensions; Classification; ORDER; PRIME;
D O I：
10.1016/j.jalgebra.2013.09.028
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP implementation of this method for finite solvable groups and exhibit some sample applications. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码：166 / 182
页数：17
相关论文
共 28 条
  • [1] [Anonymous], 2004, GAP GROUPS ALGORITHM
  • [2] Archer C., 1998, THESIS U LIBRE BRUXE, DOI Universite Libre de Bruxelles
  • [3] A millennium project: Constructing small groups
    Besche, HU
    Eick, B
    O'Brien, EA
    [J]. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2002, 12 (05) : 623 - 644
  • [4] The groups of order qn • p
    Besche, HU
    Eick, B
    [J]. COMMUNICATIONS IN ALGEBRA, 2001, 29 (04) : 1759 - 1772
  • [5] Construction of finite groups
    Besche, HU
    Eick, B
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (04) : 387 - 404
  • [6] The groups of order at most 2000
    Besche, HU
    Eick, B
    O'Brien, EA
    [J]. ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY, 2001, 7 : 1 - 4
  • [7] Enumerating p-groups
    Eick, B
    O'Brien, EA
    [J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1999, 67 : 191 - 205
  • [8] Eick B., 2005, AUTPGRP COMPUTING AU
  • [9] Eick B., 2005, POLYCYCLIC COMPUTING
  • [10] Eick B., 1996, CHARACTERISIERUNG KO
123