| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401752 | Journal of Symbolic Computation | 2015 | 34 Pages |
Abstract
We describe an algorithm to compute a composition tree for a matrix group defined over a finite field, and show how to use the associated structure to carry out computations with such groups; these include finding composition and chief series, the soluble radical, and Sylow subgroups.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Henrik Bäärnhielm, Derek Holt, C.R. Leedham-Green, E.A. O'Brien,