Galois Group Computation for Rational Polynomials

29Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We describe methods for the computation of Galois groups of univariate polynomials over the rationals which we have implemented up to degree 15. These methods are based on Stauduhar's algorithm. All computations are done in unramified p -adic extensions. For imprimitive groups we give an improvement using subfields. In the primitive case we use known subgroups of the Galois group together with a combination of Stauduhar's method and the absolute resolvent method. © 2000 Academic Press.

Cite

CITATION STYLE

APA

Geissler, K., & Klüners, J. (2000). Galois Group Computation for Rational Polynomials. Journal of Symbolic Computation, 30(6), 653–674. https://doi.org/10.1006/jsco.2000.0377

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free