UTHM Institutional Repository

Finding the Galois Group of a polynomial: a demonstration of Stauduhar’s Method

Andri, Tengku Muhammad Finding the Galois Group of a polynomial: a demonstration of Stauduhar’s Method. In: The 2nd International Conference on Research and Education in Mathematics (ICREM 2) , 25-27 May 2005, Banoi.

[img]
Preview
PDF
19-31'T.pdf

Download (208kB)

Abstract

The purpose of this paper is to demonstrate an algorithm to find the Galois group of any monic irreducible polynomial over the field of the rationals with integer coefficients. This algorithm was invented by Richard Stauduhar [15], hence, for the rest it is called the Stauduhar’s method. In order to identify the correct subgroup of Sn, several conditions are assumed. Since in every case complex roots, discriminants, and the conjugate values of some functions (to be defined later) must be computed the coefficients of input polynomial must be chosen so there will be relatively small round-off errors. It is further assumed that no two roots are very close to each other and there are no exceptionally large or small roots.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA273 Probabilities. Mathematical statistics
Depositing User: Normajihan Abd. Rahman
Date Deposited: 08 Nov 2012 01:22
Last Modified: 08 Nov 2012 01:22
URI: http://eprints.uthm.edu.my/id/eprint/2671
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year