Passer à la navigation principale Passer à la recherche Passer au contenu principal

Fast decomposition of polynomials with known Galois group

  • Laboratoire d'Informatique (LIX)

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionChapitreRevue par des pairs

Résumé

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.

langue originaleAnglais
titreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
rédacteurs en chefMarc Fossorier, Tom Hoholdt, Alain Poli
EditeurSpringer Verlag
Pages254-264
Nombre de pages11
ISBN (imprimé)3540401113
Les DOIs
étatPublié - 1 janv. 2003

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2643
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Empreinte digitale

Examiner les sujets de recherche de « Fast decomposition of polynomials with known Galois group ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation