Computing subgroups of bounded index in a finite group.

DOI10.1016/j.jsc.2005.02.002zbMath1124.20014OpenAlexW2009450855MaRDI QIDQ2456583

Michael C. Slattery, Allan K. Steel, John J. Cannon, Derek F. Holt

Publication date: 19 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2005.02.002

zbMATH Keywords

algorithmsfinite groupsconjugacy classes of subgroupssubgroup latticescomputation

Mathematics Subject Classification ID

Related Items (5)

Computing Projective Indecomposable Modules and Higher Cohomology Groups ⋮ The use of permutation representations in structural computations in large finite matrix groups ⋮ Computing Hall subgroups of finite groups ⋮ Construction of the irreducible modular representations of a finite group ⋮ The perfect groups of order up to two million

Uses Software

• Magma
• MeatAxe
• Polycyclic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing subgroups invariant under a set of automorphisms
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• The Magma algebra system. I: The user language
• Computing maximal subgroups of finite groups.
• On minimal faithful permutation representations of finite groups
• Explicit Galois realization of transitive groups of degree up to 15
• Computing the subgroups of a permutation group
• Computing projectors, injectors, residuals and radicals of finite soluble groups

This page was built for publication: Computing subgroups of bounded index in a finite group.