Fast decomposition of polynomials with known Galois group

Andreas Enge, François Morain

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Let f(X) be a separable polynomial with coefficients in a field K, generating a field extension M/K. If this extension is Galois with a solvable automorphism group, then the equation f(X) = 0 can be solved by radicals. The first step of the solution consists of splitting the extension M/K into intermediate fields. Such computations are classical, and we explain how fast polynomial arithmetic can be used to speed up the process. Moreover, we extend the algorithms to a more general case of extensions that are no longer Galois. Numerical examples are provided, including results obtained with our implementation for Hilbert class fields of imaginary quadratic fields.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMarc Fossorier, Tom Hoholdt, Alain Poli
PublisherSpringer Verlag
Pages254-264
Number of pages11
ISBN (Print)3540401113
DOIs
Publication statusPublished - 1 Jan 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2643
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Fast decomposition of polynomials with known Galois group'. Together they form a unique fingerprint.

Cite this