Computing a chief series and the soluble radical of a matrix group over a finite fieldAbstract: We describe an algorithm for computing a chief series, the soluble radical, and two other characteristic subgroups of a matrix group over a finite field, which is intended for matrix groups that are too large for the use of base and strong generating set methods. The algorithm has been implemented in MAGMA by the second author. |
| This paper is available as | (326 KB). |
All papers published in the LMS JCM are covered by a copyright agreement with the authors. Access to the papers is bound by this agreement; click here for details.
Go to the Volume 11 index
Return to the LMS JCM Homepage