Some Remarks on Computing Galois Groups
- 1 August 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (3) , 344-347
- https://doi.org/10.1137/0208026
Abstract
Computational techniques based on Chebotarev’s density theorem and tests for multiple transitivity are of use in finding the Galois group of a given polynomial. A computer search for trinomials having certain Galois groups over the rationals has produced examples with $PSL_3 (2)$ as Galois group but none with the Mathieu group $M_{11} $.
Keywords
This publication has 5 references indexed in Scilit:
- Polynomials with PSL(2, 7) as Galois groupJournal of Number Theory, 1979
- Galois Resolvents of Permutation GroupsThe American Mathematical Monthly, 1977
- Transitivity of permutation groups on unordered setsMathematische Zeitschrift, 1976
- The determination of Galois groupsMathematics of Computation, 1973
- Modular forms on noncongruence subgroupsPublished by American Mathematical Society (AMS) ,1971