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 metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01294703
Contributor : Lip6 Publications <>
Submitted on : Wednesday, November 23, 2016 - 4:45:38 PM
Last modification on : Thursday, March 21, 2019 - 2:46:46 PM
Long-term archiving on : Monday, March 20, 2017 - 7:48:29 PM

File

ISSAC09.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

364

Files downloads

157