Computation schemes for splitting fields of polynomials. (English) Zbl 1237.68259
May, John P. (ed.), ISSAC 2009. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, July 28–31, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-609-0). 279-286 (2009).
MSC:
| 68W30 | Symbolic computation and algebraic computation |
| 12-04 | Software, source code, etc. for problems pertaining to field theory |
| 12Y05 | Computational aspects of field theory and polynomials (MSC2010) |
| 12F99 | Field extensions |
References:
| [1] | Anai, H., Noro, M. and Yokoyama, K. Computation of the splitting fields and the Galois groups of polynomials. In Algorithms in algebraic geometry and applications (Santander, 1994), vol. 143 of Progr. Math. Birkhäuser, Basel, 1996, pp. 29-50. · Zbl 0867.12006 |
| [2] | Becker, T. and Weispfenning, V. Gröbner bases, vol. 141 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1993. A computational approach to commutative algebra, In cooperation with Heinz Kredel. · Zbl 0772.13010 |
| [3] | Cauchy, A. (Euvres complètes, Gauthier-Villars (Paris), Série 1, tome 5, 1882-1974. Gallica electronic distribution: http://gallica2.bnf.fr/ark:/12148/bpt6k901859 |
| [4] | Bosma, W., Cannon, J., and Playoust, C. The Magma algebra system. I. The user language. J. Symbolic Comput. 24, 3-4 (1997), 235-265. 10.1006/jsco.1996.0125 · Zbl 0898.68039 |
| [5] | Cox, D., Little, J. and O’Shea, D. Ideals, varieties, and algorithms, second ed. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1997. |
| [6] | Dahan, X., and Schost, É. Sharp estimates for triangular sets. In ISSAC ’04: Proc. of the 2004 International Symposium on Symbolic and Algebraic Computation (New York, 2004), ACM Press, pp. 103-110. 10.1145/1005285.1005302 · Zbl 1134.13308 |
| [7] | The GAP Group, Groups, Algorithms, and Programming, Ver. 4.4.12, 2008. http://www.gap-system.org |
| [8] | Geissler K. and Klüners, J. Galois group computation for rational polynomials. J. Symbolic Comput., 30(6):653-674, 2000. 10.1006/jsco.2000.0377 · Zbl 0960.11054 |
| [9] | Hulpke, A., Block systems of a Galois group. Experiment. Math., Vol. 4, 1995, nb. 1, pp 1-9. · Zbl 0976.12006 |
| [10] | Lazard, D. Solving zero-dimensional algebraic systems. J. Symbolic Comput. 13, 2 (1992), 117-131. 10.1016/S0747-7171(08)80086-7 · Zbl 0753.13012 |
| [11] | Lederer, M., Explicit constructions in splitting fields of polynomials. Riv. Mat. Univ. Parma (7), 3* (2004), 233-244. · Zbl 1159.13303 |
| [12] | McKay, J. and Stauduhar, R. Finding relations among the roots of an irreducible polynomial. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI) (New York, 1997), ACM, pp. 75-77 (electronic). 10.1145/258726.258752 · Zbl 0942.12002 |
| [13] | Meldrum, J. D. P. Wreath products of groups and semigroups Pitman Monographs and Surveys in Pure and Applied Mathematics, vol. 74. Longman, 1995. ISBN 0-582-02693-8. · Zbl 0833.20001 |
| [14] | Orange, S. Calcul de corps de décomposition - Utilisation fine d’ensembles de permutations en théorie de Galois effective - PhD Thesis, LIP6, University Paris 06, 2006. |
| [15] | Orange, S. and Renault, G. and Valibouze, A., Calcul efficace de corps de décomposition. LIP6 Research Report 005, Laboratoire d’Informatique de Paris 6, 2003. |
| [16] | Renault, G. Computation of the Splitting Field of a Dihedral Polynomial. In Proc. of the 2006 International Symposium on Symbolic and Algebraic Computation (Genova, Italy) (New York, 2006). ACM Press. 10.1145/1145768.1145816 · Zbl 1356.12014 |
| [17] | Renault, G. and Yokoyama, K. A modular method for computing the splitting field of a polynomial. In Proc. of the 7th Algorithmic Number Theory Symposium ANTS-VII, Berlin, Germany, 2006, LNCS 4076, Springer. 10.1007/11792086_10 · Zbl 1143.11372 |
| [18] | Renault, G. and Yokoyama, K. A multi-modular algorithm for computing the splitting field of a polynomial. In Proc. of the 2008 International Symposium on Symbolic and Algebraic Computation (Linz, Austria) (New York, 2008). ACM Press. 10.1145/1390768.1390803 |
| [19] | Rennert, N. and Valibouze, A. Calcul de résolvantes avec les modules de Cauchy. Exp. Math., 8(4):351-366, 1999. · Zbl 1002.12004 |
| [20] | Seress, Á. Permutation group algorithms. Cambridge Tracts in Mathematics, vol 152 Cambridge University, 2003 ISBN 0-521-66103-X · Zbl 1028.20002 |
| [21] | Sims, C. C., Computation with permutation groups, In SYMSAC ’71: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, 1971, pp 23-28. 10.1145/800204.806264 · Zbl 0449.20002 |
| [22] | Tchebotarev, N. Gründzüge des Galois’shen Theorie. P. Noordhoff, 1950. |
| [23] | Trager, B. Algebraic factoring and rational functiun integration. In Proceedings of SYMSAC’76 (1976), pp. 219-226. 10.1145/800205.806338 · Zbl 0498.12005 |
| [24] | Yokoyama, K. A modular method for computing the Galois groups of polynomials. J. Pure Appl. Algebra 117/118 (1997), 617-636. Algorithms for algebra (Eindhoven, 1996). · Zbl 0887.11047 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
