Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

The determination of Galois groups
HTML articles powered by AMS MathViewer

by Richard P. Stauduhar PDF
Math. Comp. 27 (1973), 981-996 Request permission

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
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
  • © Copyright 1973 American Mathematical Society
  • Journal: Math. Comp. 27 (1973), 981-996
  • MSC: Primary 12-04; Secondary 12A55
  • DOI: https://doi.org/10.1090/S0025-5718-1973-0327712-4
  • MathSciNet review: 0327712