Some remarks on the computation of complements and normalizers in soluble groups

DOI10.1007/BF00053292zbMath0719.20010OpenAlexW4256614730MaRDI QIDQ2639959

F. Celler, Charles R. B. Wright, Joachim Neubüser

Publication date: 1990

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00053292

zbMATH Keywords

normal seriescomplement algorithmsconjugacy classes of complements to normal subgroupsFinite soluble groupsnormalizer algorithmpower-commutator-presentation

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Derived series, central series, and generalizations for groups (20F14) Products of subgroups of abstract finite groups (20D40)

Related Items

Computing maximal subgroups of finite groups., Obituary: Joachim Neubüser (1932--2021), Constructing transitive permutation groups., Computing double cosets in soluble groups, Computing Hall subgroups of finite groups, On the subgroup permutability degree of the simple Suzuki groups., Computing projectors, injectors, residuals and radicals of finite soluble groups, Some computational aspects of solvable regular covers of graphs, Computing subgroups by exhibition in finite solvable groups, Orbit-stabilizer problems and computing normalizers for polycyclic groups.

Uses Software

• GAP

Cites Work

• Verifying nilpotence
• Collection from the left and other strategies
• Computing the order of a solvable permutation group
• Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
• Collection from the left
• Computing intersections and normalizers in soluble groups
• Towards a soluble quotient algorithm
• Determination of the lattices of subgroups of finite \(p\)-groups on a programmable electronic dual machine
• Calculating characters of \(p\)-groups
• A computer application to finite p-groups
• Some remarks on the computation of conjugacy classes of soluble groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item