论文信息 - Generation of groups of square-free order

Generation of groups of square-free order

Algorithms are described for the enumeration and recognition of groups whose order is a product of distinct primes. The focus is on providing access to isomorphism classes of such groups by computing representatives as needed rather than storing a large database of precomputed groups.

Michael C. Slattery

[1] John McKay,et al. On Transitive Permutation Groups , 1998, LMS J. Comput. Math..

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

[3] B. Huppert. Endliche Gruppen I , 1967 .

[4] Robert A. Wilson,et al. The Atlas of Finite Groups - Ten Years on: An Atlas of sporadic group representations , 1998 .

[5] B. Eick,et al. On the groups of cube-free order , 2005 .

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

[7] Bettina Eick,et al. The groups of order at most 2000 , 2001 .