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

algorithmsnormalizernormal seriesCAYLEYcomputation of large orbits of cosetsintersection of two subgroupsorbit-stabilizer algorithmpower- commutator-presentationSoluble groups

Mathematics Subject Classification ID

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

Related Items (6)

Towards Efficient Normalizers of Primitive Groups ⋮ Some remarks on the computation of complements and normalizers in soluble groups ⋮ Algorithms for polycyclic-by-finite groups ⋮ An Inductive Schema for Computing Conjugacy Classes in Permutation Groups ⋮ Computing double cosets in soluble groups ⋮ Orbit-stabilizer problems and computing normalizers for polycyclic 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

This page was built for publication: Computing intersections and normalizers in soluble groups