Intersecting subgroups of finite soluble groups

DOI10.1016/S0747-7171(88)80031-2zbMath0654.20002OpenAlexW2008105878MaRDI QIDQ1108367

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)80031-2

zbMATH Keywords

algorithmsgeneratorsintersection of subgroupsfinite solvable groupCAYLEYfinite p-groupspower-commutator presentationHall \(\pi \) -subgroupscollection processesnormalizers of subgroupspcp- generatorsSOGOS

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 (3)

Intersecting subgroups of finite soluble groups ⋮ Computing in permutation and matrix groups. III: Sylow subgroups ⋮ Computing intersections and normalizers in soluble groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing normalisers in finite soluble groups
• Intersecting subgroups of finite soluble groups
• Group-theoretic algorithms and graph isomorphism
• Splitting Properties of Soluble Groups
• On the System Normalizers of a Soluble Group
• The construction of soluble groups.

This page was built for publication: Intersecting subgroups of finite soluble groups