Computing maximal subgroups of finite groups.

DOI10.1016/j.jsc.2003.08.002zbMath1125.20306OpenAlexW2073876613MaRDI QIDQ2643528

John J. Cannon, Derek F. Holt

Publication date: 24 August 2007

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

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

zbMATH Keywords

algorithmsconjugacy classesfinite permutation groupsMAGMAcomplementssupplementsminimal normal subgroupsmaximal subgroups of finite groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Maximal subgroups (20E28) Special subgroups (Frattini, Fitting, etc.) (20D25) Software, source code, etc. for problems pertaining to group theory (20-04) Products of subgroups of abstract finite groups (20D40)

Related Items

Maximal Complements in Finite Groups, Computing maximal subsemigroups of a finite semigroup, A finiteness theorem for specializations of dynatomic polynomials, Computation of Galois Groups in magma, The affine primitive permutation groups of degree less than 1000., Computing conjugacy classes of elements in matrix groups., Galois groups over rational function fields and explicit Hilbert irreducibility, THE CONTRIBUTION OF L. G. KOVÁCS TO THE THEORY OF PERMUTATION GROUPS, Unnamed Item, Constructing transitive permutation groups., Computing subgroups of bounded index in a finite group., Fast constructive recognition of black box symplectic groups., The use of permutation representations in structural computations in large finite matrix groups, Computing conjugacy class representatives in permutation groups., Computing the soluble radical of a permutation group., All Finite Generalized Tetrahedron Groups, Construction of the irreducible modular representations of a finite group, Locally \(s\)-arc-transitive graphs related to sporadic simple groups, Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field, Invariants for the computation of intransitive and transitive Galois groups, Computing Galois groups of polynomials (especially over function fields of prime characteristic), On the factor alpha in Peyre’s constant, Unnamed Item

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal subgroups in composite finite groups
• On normal subgroups which are direct products
• Fundamental algorithms for permutation groups
• The Magma algebra system. I: The user language
• Automorphism group computation and isomorphism testing in finite groups
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Some remarks on the computation of complements and normalizers in soluble groups
• Über einen Algorithmus zur Bestimmung der Raumgruppen
• Black box classical groups
• On minimal faithful permutation representations of finite groups
• EMBEDDINGS OF GROUP EXTENSIONS INTO WREATH PRODUCTS
• Maximal subgroups of finite groups
• Computing the subgroups of a permutation group