Computation schemes for splitting fields of polynomials

Sébastien Orange, Guénaël Renault, Kazuhiro Yokoyama

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationISSAC 2009 - Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation
Pages279-286
Number of pages8
DOIs
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009 - Seoul, Korea, Republic of
Duration: 28 Jul 200931 Jul 2009

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period28/07/0931/07/09

Keywords

  • Galois theory
  • Splitting field
  • Triangular set

Fingerprint

Dive into the research topics of 'Computation schemes for splitting fields of polynomials'. Together they form a unique fingerprint.

Cite this