Abstract

This chapter discusses a computational method for determining the automorphism group of a finite solvable group. Many problems in the theory of finite groups, especially of the extension theory, depend on the knowledge of the structure of the automorphism group A(G) of a finite group G. A computer program for determining A(G) of a finite group G has been described in the chapter. With a view to the computational construction of A(G) it is profitable to develop systematically methods for determining A(G) by composition of allowable automorphisms of special subgroups of G.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call