Linear differential operators for polynomial equations

Journal of Symbolic Computation

Volumn 34, Issue 5, 2002, Pages 355-398

  Cormier, Olivier ^a   Singer, Michael F ^b   Trager, Barry M ^c   Ulmer, Felix ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036851551     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0564     Document Type: Article

References (44)

1. Abramov, S. A. (1989). Rational solutions of linear differential and difference equations with polynomial coefficients. USSR Comput. Math. Math. Phys., 29, 1611-1620.
2. Bajaj, C., Canny, J., Garrity, T., Warren, J. (1993). Factoring rational polynomials over the complex numbers. SIAM J. Comput., 22, 318-331.
3. Barkatou, M. (1999). On rational solutions of systems of linear differential equations. J. Symb. Comput., 28, 547-568.
4. Bronstein, M. (1992). Solutions of linear differential equations in their coefficient field. J. Symb. Comput., 13, 413-439.
5. Chudnovsky, D. V., Chudnovsky, G. V. (1986). On expansion of algebraic functions in power and Puiseux series. I. J. Complexity, 2, 271-294.
6. Chudnovsky, D. V., Chudnovsky, G. V. (1987). On expansion of algebraic functions in power and Puiseux series. II. J. Complexity, 3, 1-25.
7. Comtet, L. (1964). Calcul pratique des coefficients de Taylor d'une fonction algébrique. Enseignement Math., 2, 267-270.
8. Conway, J. H., Hulpke, A., McKay, J. (1998). On transitive permutation groups. LMS J. Comput. Math., 1, 1-8. (electronic).
9. Corless, R. M., Galligo, A., Kotsireas, I. S., Watt, S. M. (2002). A symbolic geometric algorithm for factoring multivariate polynomials. In Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation. Lille, France, ACM Press.
10. Cormier, O., Singer, M. F., Ulmer, F. (2000). Computing the Galois group of a polynomial using linear differential equations. In Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, pp. 78-85. St. Andrews, ACM Press.
11. Dottax, E. (2001). Calcul du Genre d'une Courbe Algébrique, Preprint, INRIA Sophia Antipolis (http://www.inria.fr/cafe/stages/rapports/dottax.ps.gz).
12. Duval, D. (1991). Absolute factorization of polynomials: a geometric approach. SIAM J. Comput., 20, 1-21.
13. Eichler, M. (1966). Introduction to the Theory of Algebraic Numbers and Functions. New York, Academic Press.
14. Galligo, A., Watt, S. M. (1977). A numerical absolute primality test for bivariate polynomials. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp. 217-224. ACM Press.
15. Gao, S. (2001). Factoring multivariable polynomials via partial differential equations, Preprint, Clemson University.
16. Gorenstein, D. (1968). Finite Groups. New York, London, Harper & Row.
17. Henry, J. P. G., Merle, M. (1989). Complexity of computation of embedded resolution of algebraic curves. In EUROCAL'87 (Leipzig, 1987), LNCS 378, pp. 381-390. Berlin, Springer.
18. Huppert, B. (1967). Endliche Gruppen I. Berlin, New York, Springer.
19. Kaltofen, E. (1995). Effective Noether irreducibility forms and applications, Symposium on the Theory of Computing (New Orleans, LA, 1991). J. Comput. Syst. Sci., 50, 274-295.
20. nd edn. Paris, Herman.
21. rd edn. New York, Addison Wesley Inc.
22. Lenstra, H. W. (1992). Algorithms in algebraic number theory. Bull. Am. Math. Soc., 26, 211-244.
23. Mattman, T., McKay, J. (0000). Computation of Galois groups over function fields. Math. Comput., 66, 823-831.
24. Malle, G., Matzat, H. (1999). Inverse Galois Theory, Springer Monographs in Mathematics. Berlin, Springer.
25. Matzat, H., McKay, J., Yokoyama, K. (2000). Special issue on algorithmic methods in Galois theory, foreword of the guest editors. J. Symb. Comput., 30, 631-633.
26. Oaku, T., Takayama, N., Tsai, H. (2001). Polynomial and rational solutions of holonomic systems, Effective methods in algebraic geometry (Bath, 2000). J. Pure Appl. Algebr., 164, 199-220.
27. Poole, E. G. C. (1960). Introduction to the Theory of Linear Differential Equations. New York, Dover Publications Inc.
28. Ragot, J.-F. (1997). Sur la factorisation absolue des polynômes, Thèse. Université de Limoges.
29. Ritt, J. F. (1966). Differential Algebra. New York, Dover Publications Inc.
30. Rybowicz, M. (1990). Sur le calcul des places et des anneaux d'entiers d'un corps de fonctions algébriques, Thèse. Université de Limoges.
31. Saito, M., Sturmfels, B., Takayama, N. (2000). Gröbner Deformations of Hypergeometric Differential Equations, Volume 6 of Algorithms and Computation in Mathematics. Berlin, Springer.
32. Singer, M. F. (1979). Algebraic solutions of n-th order linear differential equations. In Proceedings of the 1979 Queens Conference on Number Theory, pp. 379-420, Queen's Papers in Pure and Appl. Math. 54.
33. Singer, M. F. (1996). Testing reducibility of linear differential operators: a group theoretic perspective. Appl. Algebr. Eng. Commun. Comput., 7, 77-104.
34. Singer, M. F., Ulmer, F. (1993). Galois groups for second and third order linear differential equations. J. Symb. Comput., 16, 1-36.
35. Teitelbaum, J. (1990). The computational complexity of the resolution of plane curve singularities. Math. Comput., 54, 797-837.
36. Trager, B. M. (1984). Integration of algebraic functions. Ph.D. Thesis, MIT.
37. van der Put, M., Singer, M. F. (2001). Differential Galois theory, preprint.
38. nd edn. New York, Frederick Ungar Publishing Co.
39. van Hoeij, M. (1994). An algorithm for computing an integral basis in an algebraic function field. J. Symb. Comput., 18, 353-363.
40. van Hoeij, M. (1997). Factorization of differential operators with rational functions coefficients. J. Symb. Comput., 24, 53-561.
41. von zur Gathen, J., Gerhard, J. (1999). Modern Computer Algebra. Cambridge, Cambridge University Press.
42. Walker, R. J. (1962). Algebraic Curves. New York, Dover Publications Inc.
43. Winkler, F. (1996). Polynomial Algorithms in Computer Algebra, Texts and Monographs in Symbolic Computation. Vienna, Springer.
44. Zippel, R. (1993). Efficient Polynomial Computation. Boston, Kluwer Academic Publishers.