Name
Abstract | ||
|---|---|---|
This article describes an algorithm for computing up to conjugacy all subgroups of a finite solvable group that are invariant under a set of automorphisms. It constructs the subgroups stepping down along a normal chain with elementary abelian factors. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/jsco.1998.0260 | J. Symb. Comput. |
Keywords | DocType | Volume |
Computing subgroups invariant | Journal | 27 |
Issue | ISSN | Citations |
4 | Journal of Symbolic Computation | 4 |
PageRank | References | Authors |
0.71 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Hulpke | 1 | 64 | 9.89 |