Skip to Main content Skip to Navigation
Conference papers

Computation Schemes for Splitting Fields of Polynomials

Abstract : In this article, we present new results about the computation of a general shape of a triangular basis generating the splitting ideal of an irreducible polynomial given with the permutation representation of its Galois group G. We provide some theoretical results and a new general algorithm based on the study of the non redundant bases of permutation groups. These new results deeply increase the efficiency of the computation of the splitting field of a polynomial.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Wednesday, November 23, 2016 - 4:45:38 PM
Last modification on : Tuesday, July 5, 2022 - 8:39:08 AM
Long-term archiving on: : Monday, March 20, 2017 - 7:48:29 PM


Files produced by the author(s)



Sébastien Orange, Guénaël Renault, Kazuhiro Yokoyama. Computation Schemes for Splitting Fields of Polynomials. ISSAC '09: the 2009 international symposium on Symbolic and algebraic computation, Jul 2009, Seoul, South Korea. pp.279-286, ⟨10.1145/1576702.1576741⟩. ⟨hal-01294703⟩



Record views


Files downloads