The groups of order at most 2000

被引：25
作者：
Besche, HU
Eick, B
O'Brien, EA
机构：
[1] Rhein Westfal TH Aachen, Lehrstuhl Math D, D-52062 Aachen, Germany
[2] Univ Kassel, Fachbereich Math, D-34132 Kassel, Germany
[3] Univ Auckland, Dept Math, Auckland, New Zealand
来源：
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY | 2001年 / 7卷
关键词：
enumeration; determination; small groups; algorithms;
D O I：
10.1090/S1079-6762-01-00087-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We announce the construction up to isomorphism of the 49 910 529 484 groups of order at most 2000.
引用
收藏
页码：1 / 4
页数：4
相关论文
共 14 条
  • [1] [Anonymous], P LONDON MATH SOC
  • [2] BESCH HU, 2001, COMM ALGEBRA
  • [3] Construction of finite groups
    Besche, HU
    Eick, B
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (04) : 387 - 404
  • [4] BESCHE HU, MILLENNIUM PROJECT C
  • [5] The Magma algebra system .1. The user language
    Bosma, W
    Cannon, J
    Playoust, C
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) : 235 - 265
  • [6] 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
  • [7] *GAP GROUP, 2000, GAP GROUPS ALG PROGR
  • [8] HALL M, 1964, GROUPS ORDER 2N N LE
  • [9] Laue R., 1982, BAYREUTH MATH SCHR, V9
  • [10] NEUBUSER J, 1967, THESIS KIEL
12