Computing Subgroups by Exhibition in Finite Solvable Groups

We present practical algorithms to compute subgroups such as Hall systems, system normalizers,F-normalizers and F -covering subgroups in finite solvable groups. An application is an algorithm to calculate head complements in finite solvable groups; that is, complements which are closely related to maximal subgroups. Our algorithms use the technique of exhibiting subgroups.