Computing automorphisms of finite soluble groups

DOI10.1017/S0004972700016841zbMATH Open0845.20017MaRDI QIDQ4881968FDOQ4881968

Michael J. C. Smith

Publication date: 16 September 1996

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

algorithmsautomorphismsfinite soluble groups

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Automorphisms of abstract finite groups (20D45) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Computing with endomorphism rings of modular representations

Cited In (4)

• Computational approaches to the theory of finite soluble groups
• Algorithms for Group Isomorphism via Group Extensions and Cohomology
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Magma

This page was built for publication: Computing automorphisms of finite soluble groups

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