Computing subgroups by exhibition in finite solvable groups

DOI10.1006/jsco.2000.0503zbMath0995.20004OpenAlexW2010725816MaRDI QIDQ1599538

Charles R. B. Wright, Bettina Eick

Publication date: 11 June 2002

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

Full work available at URL: https://semanticscholar.org/paper/412e6df5b681d0881c51bfc35caff7648a7593b6

zbMATH Keywords

algorithmsfinite solvable groupscomplementssystem normalizerscovering subgroups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

Solving a class of higher-order equations over a group structure ⋮ Special polycyclic generating sequences for finite soluble groups. ⋮ Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality ⋮ Filters compatible with isomorphism testing ⋮ Computing projectors, injectors, residuals and radicals of finite soluble groups

Uses Software

• GAP

Cites Work

• On internal formation theory
• Computing the order of a solvable permutation group
• Towards a soluble quotient algorithm
• Zur Theorie der endlichen auflösbaren Gruppen
• Finite soluble groups
• A finite soluble quotient algorithm
• The \(\mathfrak F\)-normalizers of a finite soluble group
• An internal approach to covering groups
• Some remarks on the computation of complements and normalizers in soluble groups
• Unnamed Item
• Unnamed Item
• Unnamed Item