论文信息 - Enumerating p-Groups

Enumerating p-Groups

We present a new algorithm which uses a cohomological approach to determine the groups of order p n , where p is a prime. We develop two methods to enumerate p -groups using the Cauchy-Frobenius Lemma. As an application we show that there are 10 494213 groups of order 2 9 . 1991 Mathematics subject classification (Amer. Math. Soc.) : primary 20D15.

Bettina Eick | E. A. O'Brien | E. O'Brien | B. Eick

[1] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[2] Garrett Birkhoff,et al. Subgroups of Abelian Groups , 1935 .

[3] Alexander Wegner. The construction of finite soluble factor groups of finitely presented groups and its application , 1992 .

[4] G. Higman,et al. Enumerating p‐Groups. I: Inequalities , 1960 .

[5] E. A. O'Brien,et al. The p-Group Generation Algorithm , 1990, J. Symb. Comput..

[6] Bettina Eick,et al. Construction of Finite Groups , 1999, J. Symb. Comput..

[7] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .

[8] E. O'Brien,et al. The groups of order 256 , 1991 .

[9] Charles C. Sims,et al. Enumerating p‐Groups , 1965 .

[10] D. Robinson. A Course in the Theory of Groups , 1982 .

[11] M. F. Newman,et al. Determination of groups of prime-power order , 1977 .

[12] E. A. O'Brien,et al. The groups of order 128 , 1990 .

[13] E. O'Brien,et al. Computing Automorphism Groups of p -Groups , 1995 .

[14] Bettina Eick,et al. The Groups of Order at Most 1000 Except 512 and 768 , 1999, J. Symb. Comput..