Symbolic computation of resolvents
Sandi Rudzinski · NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro) · 2017
Resolvent polynomials are used in the determination of Galois groups of polynomials. The computation of the resolvent usually relies on root approximations requiring a high degree of precision. Leonard Soicher developed a method to compute absolute linear resolvents symbolically without the need for root approximations. This thesis details that method and expands it to compute relative linear resolvents symbolically with respect to the wreath product of a symmetric group and a transitive permutation group.