The construction of finite solvable groups revisited
classification
🧮 math.GR
keywords
finitegroupsconstructionsolvableapproachisomorphismalgorithmapplications
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.