Construction of finite groups

DOI10.1006/JSCO.1998.0258zbMath0922.20001OpenAlexW2060107734MaRDI QIDQ1283195

Hans Ulrich Besche, Bettina Eick

Publication date: 18 August 1999

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

Full work available at URL: https://doi.org/10.1006/jsco.1998.0258

zbMATH Keywords

algorithmsfinite groupsconstructionsFrattini extensionsextensions of solvable groupsisomorphism types of solvable groups

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Special subgroups (Frattini, Fitting, etc.) (20D25) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (17)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS ⋮ Constructing Groups of ‘Small’ Order: Recent Results and Open Problems ⋮ The construction of finite solvable groups revisited. ⋮ On the isomorphism problem for split extensions ⋮ On character varieties with non-connected structure groups ⋮ Unnamed Item ⋮ Generation of groups of square-free order. ⋮ THE GROUPS OF ORDER qⁿ· p ⋮ The groups of order at most 2000 ⋮ Periodic patterns in the graph of p-groups of maximal class ⋮ Count-free Weisfeiler-Leman and group isomorphism ⋮ Finite groups acting on Severi-Brauer surfaces ⋮ Groups whose orders factorise into at most four primes ⋮ Counting groups: Gnus, Moas, and other exotica ⋮ Symbolic Computation Software Composability ⋮ On the groups of cube-free order.

Uses Software

• Unnamed Item

This page was built for publication: Construction of finite groups