论文信息 - Computing subgroups of bounded index in a finite group

Computing subgroups of bounded index in a finite group

We describe a practical algorithm for computing representatives of the conjugacy classes of subgroups up to a given index in a finite group. This algorithm has been implemented in Magma, and we present some performance statistics.

[1] Derek F. Holt,et al. Computing maximal subgroups of finite groups , 2004, J. Symb. Comput..

[2] J. Conway,et al. ATLAS of Finite Groups , 1985 .

[3] Derek F. Holt,et al. Computing the Subgroups of a Permutation Group , 2001, J. Symb. Comput..

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

[5] Alexander Hulpke,et al. Computing Subgroups Invariant Under a Set of Automorphisms , 1999, J. Symb. Comput..

[6] Jürgen Müller,et al. Peakword Condensation and Submodule Lattices: An Application of the Meat-Axe , 1994, J. Symb. Comput..

[7] Gunter Malle,et al. Explicit Galois Realization of Transitive Groups of Degree up to 15 , 2000, J. Symb. Comput..

[8] Alexander Hulpke. Computing normal subgroups , 1998, ISSAC '98.

[9] Bettina Eick. Computing with infinite polycyclic groups , 2001 .

[10] Derek F. Holt,et al. Testing modules for irreducibility , 1994, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[11] Derek F. Holt. REPRESENTING QUOTIENTS OF PERMUTATION GROUPS , 1997 .

[12] Cheryl E. Praeger,et al. On minimal faithful permutation representations of finite groups , 2000, Bulletin of the Australian Mathematical Society.

[13] Burkhard Höfling. Computing Projectors, Injectors, Residuals and Radicals of Finite Soluble Groups , 2001, J. Symb. Comput..