Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4597686 | Journal of Pure and Applied Algebra | 2007 | 7 Pages |
Abstract
This paper shows a probabilistic algorithm to decide whether the Galois group of a given irreducible polynomial with rational coefficients is the generalized symmetric group Cp≀SmCp≀Sm or the generalized alternating group Cp≀AmCp≀Am. In the affirmative case, we give generators of the group with their action on the set of roots of the polynomial.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
M. Ángeles Gómez-Molleda,