Computing intersections and normalizers in soluble groups

DOI10.1016/S0747-7171(08)80079-XzbMath0707.20001MaRDI QIDQ919456

Michael C. Slattery, Stephen P. Glasby

Publication date: 1990

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

zbMATH Keywords

algorithms; normalizer; normal series; CAYLEY; computation of large orbits of cosets; intersection of two subgroups; orbit-stabilizer algorithm; power- commutator-presentation; Soluble groups

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20D10: Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks

20D25: Special subgroups (Frattini, Fitting, etc.)

20F05: Generators, relations, and presentations of groups

20-04: Software, source code, etc. for problems pertaining to group theory

Related Items

An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, Computing double cosets in soluble groups, Algorithms for polycyclic-by-finite groups, Orbit-stabilizer problems and computing normalizers for polycyclic groups., Some remarks on the computation of complements and normalizers in soluble groups

Uses Software

• Cayley

Cites Work

• Constructing normalisers in finite soluble groups
• Intersecting subgroups of finite soluble groups
• Some remarks on the computation of conjugacy classes of soluble groups
• Unnamed Item
• Unnamed Item