AbstractWe propose a new method to compute the Galois group of an integral polynomial based on resolvent computation by modular techniques. We developed an exact method to find integral roots of relative resolvents by direct evaluation of invariants over some p-adic number field or its extension. Experiments on a set of test polynomials suggest that the presented method is quite practical by virtue of efficient evaluation of invariants based on modular techniques introduced here
International audienceLet f be a univariate monic integral polynomial of degree n and let (α1, ..., ...
Modular forms are tremendously important in various areas of mathematics, from number theory and alg...
International audienceModular forms are tremendously important in various areas of mathematics, from...
AbstractWe propose a new method to compute the Galois group of an integral polynomial based on resol...
AbstractWe describe methods for the computation of Galois groups of univariate polynomials over the ...
The most efficient algorithms for computing Galois groups of polynomials over global fields are base...
AbstractWe describe methods for the computation of Galois groups of univariate polynomials over the ...
Galois theory is an area of modern algebra which provides a framework for transforming problems invo...
In this thesis we consider the computation of integral closures in cyclic Galois extensions of globa...
AbstractThe aim of this paper is to exploit the algorithms of paper Experimental Math. 8 (1999) in o...
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions wi...
by Tang Ko Cheung, Simon.Thesis date on t.p. originally printed as 1997, of which 7 has been overwri...
AbstractIn this paper we show that some ideals which occur in Galois theory are generated by triangu...
AbstractThis paper presents an algorithm for computing algebraically relative resolvents which enhan...
Resolvent polynomials are used in the determination of Galois groups of polynomials. The computation...
International audienceLet f be a univariate monic integral polynomial of degree n and let (α1, ..., ...
Modular forms are tremendously important in various areas of mathematics, from number theory and alg...
International audienceModular forms are tremendously important in various areas of mathematics, from...
AbstractWe propose a new method to compute the Galois group of an integral polynomial based on resol...
AbstractWe describe methods for the computation of Galois groups of univariate polynomials over the ...
The most efficient algorithms for computing Galois groups of polynomials over global fields are base...
AbstractWe describe methods for the computation of Galois groups of univariate polynomials over the ...
Galois theory is an area of modern algebra which provides a framework for transforming problems invo...
In this thesis we consider the computation of integral closures in cyclic Galois extensions of globa...
AbstractThe aim of this paper is to exploit the algorithms of paper Experimental Math. 8 (1999) in o...
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions wi...
by Tang Ko Cheung, Simon.Thesis date on t.p. originally printed as 1997, of which 7 has been overwri...
AbstractIn this paper we show that some ideals which occur in Galois theory are generated by triangu...
AbstractThis paper presents an algorithm for computing algebraically relative resolvents which enhan...
Resolvent polynomials are used in the determination of Galois groups of polynomials. The computation...
International audienceLet f be a univariate monic integral polynomial of degree n and let (α1, ..., ...
Modular forms are tremendously important in various areas of mathematics, from number theory and alg...
International audienceModular forms are tremendously important in various areas of mathematics, from...