Computing automorphism groups of finite groups

zbMATH Open0995.20007MaRDI QIDQ2759629

Derek F. Holt

Publication date: 30 June 2002

zbMATH Keywords

algorithmsfinite groupsautomorphism groupschief factorstransitive permutation groupscomputation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Automorphisms of abstract finite groups (20D45) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (4)

Computing automorphisms of semigroups. ⋮ The construction of finite solvable groups revisited. ⋮ An effective version of the Lazard correspondence. ⋮ Computing automorphism groups and testing isomorphisms for modular group algebras.

This page was built for publication: Computing automorphism groups of finite groups

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