The construction of finite solvable groups revisited.
DOI10.1016/j.jalgebra.2013.09.028zbMath1311.20016arXiv1306.4239OpenAlexW2106382254MaRDI QIDQ402704
Publication date: 28 August 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.4239
Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Series and lattices of subgroups (20D30) Automorphisms of abstract finite groups (20D45) Extensions, wreath products, and other compositions of groups (20E22) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of finite groups
- The \(p\)-coclass of a group
- Computing a set of generators of minimal cardinality in a solvable group
- The \(p\)-group generation algorithm
- Groups and nilpotent Lie rings whose order is the sixth power of a prime.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- The groups with order \(p^7\) for odd prime \(p\).
- THE GROUPS OF ORDER qn· p
- The groups of order at most 2000
- Zu einem von B. H. und H. Neumann gestellten Problem
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- THE 2-GENERATOR RESTRICTED BURNSIDE GROUP OF EXPONENT 7
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Endliche Gruppen mit treuen absolut‐irreduziblen Darstellungen
This page was built for publication: The construction of finite solvable groups revisited.