Formal computation of Galois groups with relative resolvents

9Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propound a systematic and formal method to compute the Galois group of a non-necessarily irreducible polynomial: we proceed by successive inclusions, using mostly computations on scalars (and very few on polynomials). It is based on a formal method of specialization of relative resolvents: it consists in expressing the generic coefficients of the resolvent using the powers of a primitive element, thanks to a quadratic space structure; this reduces the problem to that of specializing a primitive element, which we are able to do in the case of the descending by successive inclusions. We incidentally supply a way to make separable a resolvent.

Cite

CITATION STYLE

APA

Colin, A. (1995). Formal computation of Galois groups with relative resolvents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 948, pp. 169–182). Springer Verlag. https://doi.org/10.1007/3-540-60114-7_13

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