Using Galois Ideals for Computing Relative Resolvents

@article{Aubry2000UsingGI,
  title={Using Galois Ideals for Computing Relative Resolvents},
  author={Philippe Aubry and A. Valibouze},
  journal={J. Symb. Comput.},
  year={2000},
  volume={30},
  pages={635-651}
}
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. 
Explicit Constructions in Splitting Fields of Polynomials
Computing the Lagrange resolvent by effectiveness of Galois Theorem
Algebraic computation of resolvents without extraneous powers
Gröbner basis of the alternating galoisian ideal
  • A. Valibouze
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 2011
Homotopy methods for multiplication modulo triangular sets
Galois theory, splitting fields and computer algebra
Homotopy techniques for multiplication modulo triangular sets
Computation of the Decomposition Group of a Triangular Ideal
Sharp estimates for triangular sets
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 66 REFERENCES
A modular method for computing the Galois groups of polynomials
Galois Group Computation for Rational Polynomials
Formal Computation of Galois Groups with Relative Resolvents
Computation of the Galois Groups of the Resolvent Factors for the Direct and Inverse Galois Problems
Computing Galois groups over the rationals
R'esolvantes Et Fonctions Sym'etriques
Solving Zero-Dimensional Algebraic Systems
  • D. Lazard
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1992
Symbolic Computation with Symmetric Polynomials an Extension to MACSYMA
Calculs d'invariants primitifs de groupes finis
...
1
2
3
4
5
...