ALGORITHMS FOR MATRIX GROUPS

Existing algorithms have only limited ability to answer structural questions about subgroups G of GL(d, F ), where F is a finite field. We discuss new and promising algorithmic approaches, both theoretical and practical, which as a first step construct a chief series for G.