Solvability by Radicals from an Algorithmic Point of View - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Solvability by Radicals from an Algorithmic Point of View

Abstract

Any textbook on Galois theory contains a proof that a polynomial equation with solvable Galois group can be solved by radicals. From a practical point of view, we need to find suitable representations of the group and the roots of the polynomial. We first reduce the problem to that of cyclic extensions of prime degree and then work out the radicals, using the work of Girstmair. We give numerical examples of Abelian and non-Abelian solvable equations and apply the general framework to the construction of Hilbert Class fields of imaginary quadratic fields.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4109.pdf (295.77 Ko) Télécharger le fichier

Dates and versions

inria-00072522 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072522 , version 1

Cite

Guillaume Hanrot, François Morain. Solvability by Radicals from an Algorithmic Point of View. [Research Report] RR-4109, INRIA. 2001. ⟨inria-00072522⟩
166 View
17507 Download

Share

Gmail Facebook Twitter LinkedIn More