A modular method for computing the Galois groups of polynomials

Journal of Pure and Applied Algebra

Volumn 117-118, Issue , 1997, Pages 617-636

  Yokoyama, K ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031145318     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(97)00030-3     Document Type: Article

References (26)

1. J.A. Abbott, On the factorisation of polynomials over algebraic fields, Ph.D. Thesis, School of Math. Sci., University of Bath, 1989.
2. H. Anai, M. Noro and K. Yokoyama, Computation of the splitting fields and the Galois groups of polynomials, in: L. González-Vega and T. Recio, eds., Algorithms in Algebraic Geometry and Applications (Birkhäuser, Basel, 1996) 29-50.
3. J.-M. Arnaudiès and A. Valibouze, Résolvantes de Lagrange, Rapport LITP 93.61, 1993.
4. T. Becker and V. Weispfenning, Gröbner Bases (Springer, New York, 1993).
5. E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comput. 24 (1970) 713-735.
6. J. Berstel and M. Mignotte, Deux propriétés décidables des suites récurrentes linéaires, Bull. Soc. Math. France 104 (1976) 175-184.
7. G. Butler, Fundamental Algorithms for Permutation Groups, Lecture Notes in Comp. Sci., Vol. 559 (Springer, New York, 1991).
8. P.J. Cameron, Some open problems on permutation groups, in: M.W. Liebeck and J. Saxl, eds., Groups, Combinatorics and Geometry (Cambridge Univ. Press, Cambridge, 1992) 340-350.
9. A. Colin, Formal computation of Galois groups with relative resolvents, in: Proc. AAECC-11, Lecture Notes in Comp. Sci., Vol. 948 (Springer, New York, 1995) 169-182.
10. 12 as Galois groups over Q, Commun. Algebra 17 (1989) 2941-2943.
11. Y. Eichenlaub and M. Olivier, Computation of Galois groups for polynomials with degree up to eleven, preprint, 1994.
12. D.J. Ford and J. McKay, Computation of Galois groups from polynomials over the rationals, in: Computer Algebra, Lecture Notes in Pure Appl. Math., Vol. 113 (Springer, New York, 1989) 145-150.
13. K. Girstmair, On invariant polynomials and their application in field theory, Math. Comput. 48 (1987) 781-797.
14. E. Kaltofen, Polynomial factorization 1987-1991, in: LATIN'92, Lecture Notes in Comput. Sci., Vol. 583 (Springer, New York, 1992) 294-313.
15. J. Klüners and M. Pohst, On computing subfields, preprint, 1996.
16. L. Langemyr, Algorithms for a multiple algebraic extension II, in: Proc. AAECC-9, Lecture Notes in Comp. Sci., Vol. 539 (Springer, New York, 1991) 224-233.
17. T. Mattman and J. McKay, Computation of Galois groups over function fields, Math. Comput. (1996) to appear.
18. M. Mignotte, Some useful bounds, in: Computer Algebra (Springer, Wien, 1982) 259-263.
19. M. Noro and T. Takeshima, Risa/Asir-a computer algebra system, in: Proc. ISSAC'92 (ACM Press, New York, 1992) 387-396.
20. M. Noro and K. Yokoyama, New methods for the change-of-ordering in Gröbner basis computation, Research Report ISIS-RR-95-8E, 1995.
21. M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory (Cambridge Univ. Press, Cambridge, 1989).
22. L. Soicher and J. McKay, Computing Galois groups over the rationals, J. Number Theory 20 (1985) 273-281.
23. R.P. Stauduhar, The determination of Galois groups, Math. Comput. 27 (1973) 981-996.
24. N. Tschbotarev and H. Schwerdtfeger, Grundzüge des Galois'schen Theorie (P. Noodhoff, Groningen, 1950).
25. A. Valibouze, Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems, in: Proc. AAECC-11, Lecture Notes in Comp. Sci., Vol. 948 (1995) 456-468.
26. P.J. Weinberger and L.P. Rothschild, Factoring polynomials over algebraic number fields, ACM Trans. Math. Software 2 (1976) 335-350.