Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

The determination of Galois groups


Author: Richard P. Stauduhar
Journal: Math. Comp. 27 (1973), 981-996
MSC: Primary 12-04; Secondary 12A55
MathSciNet review: 0327712
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A technique is described for the nontentative computer determination of the Galois groups of irreducible polynomials with integer coefficients. The technique for a given polynomial involves finding high-precision approximations to the roots of the polynomial, and fixing an ordering for these roots. The roots are then used to create resolvent polynomials of relatively small degree, the linear factors of which determine new orderings for the roots. Sequences of these resolvents isolate the Galois group of the polynomial. Machine implementation of the technique requires the use of multiple-precision integer and multiple-precision real and complex floating-point arithmetic. Using this technique, the writer has developed programs for the determination of the Galois groups of polynomials of degree $ N \leqq 7$. Two exemplary calculations are given.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 12-04, 12A55

Retrieve articles in all journals with MSC: 12-04, 12A55


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1973-0327712-4
PII: S 0025-5718(1973)0327712-4
Keywords: Galois group algorithm, resolvent equations
Article copyright: © Copyright 1973 American Mathematical Society