Computing automorphisms of finite soluble groups

DOI10.1017/S0004972700016841MaRDI QIDQ4881968zbMATH OpenFDO

Authors 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
• scientific article; zbMATH DE number 3558069 (Why is no real title available?)
• scientific article; zbMATH DE number 3968844 (Why is no real title available?)
• Algorithms for group isomorphism via group extensions and cohomology

Describes a project that uses

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)