Computing subgroups invariant under a set of automorphisms

DOI10.1006/jsco.1998.0260zbMath0943.20019OpenAlexW2139926088MaRDI QIDQ1283197

Alexander Hulpke

Publication date: 19 June 2000

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

Full work available at URL: https://semanticscholar.org/paper/a1a512911c5eaba14bc6c7a858fe1b7a3c741878

zbMATH Keywords

algorithmsfinite solvable groupsconjugacy classes of subgroupsautomorphismssubgroup latticescyclic extensionselementary Abelian extensions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Conjugacy classes for groups (20E45) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Series and lattices of subgroups (20D30)

Related Items (6)

The Solvable Primitive Permutation Groups of Degree at Most 6560 ⋮ Enumeration of left braces with additive group 𝐶₄×𝐶₄×𝐶₄ ⋮ Constructing transitive permutation groups. ⋮ Computing subgroups of bounded index in a finite group. ⋮ On the subgroup permutability degree of the simple Suzuki groups. ⋮ Computing the table of marks of a cyclic extension

Uses Software

• Magma

This page was built for publication: Computing subgroups invariant under a set of automorphisms