The construction of finite solvable groups revisited.

DOI10.1016/J.JALGEBRA.2013.09.028zbMATH Open1311.20016arXiv1306.4239OpenAlexW2106382254MaRDI QIDQ402704FDOQ402704

Authors: B. Eick, Max Horn 

Publication date: 28 August 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP implementation of this method for finite solvable groups and exhibit some sample applications.

Full work available at URL: https://arxiv.org/abs/1306.4239

Recommendations

• Construction of finite groups
• Some remarks on the computation of conjugacy classes of soluble groups
• Constructing groups of `small' order: recent results and open problems
• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• The groups of order at most 1000 except 512 and 768
• The \(p\)-group generation algorithm
• The groups of order 128
• A new \texttt{GAP} group library for irreducible maximal solvable subgroups of prime degree classical groups
• Computing subgroups invariant under a set of automorphisms
• Computing automorphism groups of finite groups

zbMATH Keywords

algorithmsclassificationenumerationextensionsfinite solvable groupssmall groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Automorphisms of abstract finite groups (20D45) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extensions, wreath products, and other compositions of groups (20E22) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Endliche Gruppen mit treuen absolut‐irreduziblen Darstellungen
• Title not available (Why is that?)
• Computing polycyclic presentations for polycyclic rational matrix groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The \(p\)-group generation algorithm
• Groups and nilpotent Lie rings whose order is the sixth power of a prime.
• The groups with order \(p^7\) for odd prime \(p\).
• Title not available (Why is that?)
• Computing a set of generators of minimal cardinality in a solvable group
• Zu einem von B. H. und H. Neumann gestellten Problem
• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• Construction of finite groups
• The \(p\)-coclass of a group
• THE GROUPS OF ORDER qⁿ· p
• The groups of order at most 2000
• APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
• Title not available (Why is that?)
• THE 2-GENERATOR RESTRICTED BURNSIDE GROUP OF EXPONENT 7

Cited In (4)

• Constructing groups of `small' order: recent results and open problems
• New Lie products for groups and their automorphisms
• GroupExt
• The enumeration of groups of order \(p^{n}q\) for \(n\leq 5\)

Uses Software

• GAP
• SmallGroups Library
• AutPGrp
• Polycyclic
• FGA
• Genss

This page was built for publication: The construction of finite solvable groups revisited.

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