Using Galois ideals for computing relative resolvents

Philippe Aubry 1, 2 Annick Valibouze 2, 3
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 CALFOR - Calcul formel
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper we show that some ideals which occur in Galois theory are generated by triangular sets of polynomials. This geometric property seems important for the development of symbolic methods in Galois theory. It may and should be exploited in order to obtain more efficient algorithms, and it enables us to present a new algebraic method for computing relative resolvents which works with any polynomial invariant.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00099277
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:52:22 AM
Last modification on : Friday, May 24, 2019 - 5:30:29 PM

Links full text

Identifiers

Citation

Philippe Aubry, Annick Valibouze. Using Galois ideals for computing relative resolvents. Journal of Symbolic Computation, Elsevier, 2000, 30 (6), pp.635--651. ⟨10.1006/jsco.2000.0376⟩. ⟨inria-00099277⟩

Share

Metrics

Record views

203