Constructing normalisers in finite soluble groups

DOI10.1016/S0747-7171(88)80030-0zbMath0654.20001OpenAlexW2056644850MaRDI QIDQ1108366

Stephen P. Glasby

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(88)80030-0

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (5)

Intersecting subgroups of finite soluble groups ⋮ Computing intersections and normalizers in soluble groups ⋮ Computing Sylow subgroups of permutation groups using homomorphic images of centralizers ⋮ An Inductive Schema for Computing Conjugacy Classes in Permutation Groups ⋮ Computing modular and projective character degrees of soluble groups

Cites Work

• Sylow's theorem in polynomial time
• Zur Theorie der endlichen auflösbaren Gruppen
• Nilpotent self-normalizing subgroups of soluble groups
• Splitting Properties of Soluble Groups
• Polynomial-time versions of Sylow's theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing normalisers in finite soluble groups