Computing Intersections and Normalizers in Soluble Groups

Authors

S. P. Glasby, Victoria University of Wellington
Michael Slattery, Marquette UniversityFollow

Document Type

Article

Language

eng

Publication Date

5-6-1990

Publisher

Elsevier

Source Publication

Journal of Symbolic Computation

Source ISSN

0747-7171

Abstract

Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescribe algorithms for constructing H∩K and N_G(H). The first author has previously described algorithms for constructing H∩K when the indices |G:H| and |G:K| are coprime, and for constructing N_G(H) when |G:H| and |H| are coprime (i.e. when H is a Hall subgroup of G). The intersection and normalizer algorithms described in the present paper are constructed from generalizations of these algorithms and from an orbit-stabilizer algorithm.

Comments

Journal of Symbolic Computation, Vol. 9, No. 5-6 (May 6, 1990): 637-651. DOI.

Recommended Citation

Glasby, S. P. and Slattery, Michael, "Computing Intersections and Normalizers in Soluble Groups" (1990). Mathematics, Statistics and Computer Science Faculty Research and Publications. 613.
https://epublications.marquette.edu/mscs_fac/613