Computing subgroups by exhibition in finite solvable groups

  • Authors:

  • Bettina Eick;Charles R.B. Wright

  • Affiliations:

  • Univ. Braunschweig, Germany;Univ. of Oregon, Eugene

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. Copyright 2002 Academic Press