Intersecting subgroups of finite soluble groups

DOI10.1016/S0747-7171(88)80031-2zbMATH Open0654.20002OpenAlexW2008105878MaRDI QIDQ1108367FDOQ1108367

S. 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) Generators, relations, and presentations of groups (20F05) Finite nilpotent groups, (p)-groups (20D15) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Group-theoretic algorithms and graph isomorphism
• Splitting Properties of Soluble Groups
• On the System Normalizers of a Soluble Group
• Constructing normalisers in finite soluble groups
• Intersecting subgroups of finite soluble groups
• The construction of soluble groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Computing subgroups by exhibition in finite solvable groups
• Calculating characters of \(p\)-groups
• Computing in permutation and matrix groups. III: Sylow subgroups
• Title not available (Why is that?)
• Collection from the left and other strategies
• Combinatorial properties of intervals in finite solvable groups
• Finding intermediate subgroups
• Intersecting subgroups of finite soluble groups
• Computing intersections and normalizers in soluble groups

   Recommendations

• Computing intersections and normalizers in soluble groups 👍 👎
• Title not available (Why is that?) 👍 👎
• Finding intersections and normalizers in finitely generated nilpotent groups 👍 👎
• Some remarks on the computation of complements and normalizers in soluble groups 👍 👎
• Algorithms for finite soluble groups and applications 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108367)