Non-commutative elimination in ore algebras proves multivariate identities

Journal of Symbolic Computation

Volumn 26, Issue 2, 1998, Pages 187-227

  Chyzak, Frédéric ^a   Salvy, Bruno ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

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

References (55)

1. Almkvist, G., Zeilberger, D. (1990). The method of differentiating under the integral sign. J. Symb. Comput., 10, 571-591.
2. Askey, R. (1992). The world of q. CWI Quarterly, 5, 251-270.
3. Becker, T., Weispfenning, V. (1993). Gröbner bases, volume 141 of Graduate Texts in Mathematics. Springer Verlag. A computational approach to commutative algebra (in cooperation with Heinz Kredel).
4. Bernstein, I. N. (1971). Modules over a ring of differential operators, study of the fundamental solutions of equations with constant coefficients. Fund. Anal. Appl., 5, 1-16 (Russian); 89-101 (English translation).
5. Bernstein, I. N. (1972). The analytic continuation of generalized functions with respect to a parameter. Fund. Anal. Appl., 6, 26-40 (Russian); 273-285 (English translation).
6. Buchberger, B. (1965). Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph. D. Thesis.
7. Buchberger, B. (1970). Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Math., 4, 374-383.
8. Buchberger, B. (1985). Gröbner bases: an algorithmic method in polynomial ideal theory. In Bose, N. K., ed., Recent Trends in Multidimensional System Theory, pp. 184-232. D. Reidel Publishing Company.
9. Cartier, P. (1992). Démonstration "automatique" d'identités et fonctions hypergéométriques. Astérisque, 206, 41-91. Séminaire Bourbaki.
10. Chyzak, F. (1994). Holonomic Systems and Automatic Proofs of Identities. Research Report 2371, Institut National de Recherche en Informatique et en Automatique.
11. Chyzak, F. (1997). An extension of Zeilberger's fast algorithm to general holonomic functions. In Formal Power Series and Algebraic Combinatorics, 9th Conference, pp. 172-183. Universität Wien.
12. Chyzak, F. (1998). PhD These. Ecole polytechnique.
13. Cohn, P. M. (1971). Free Rings and Their Relations. Number 2 in London Mathematical Society Monographs. Academic Press.
14. Comtet, L. (1964). Calcul pratique des coefficients de Taylor d'une fonction algébrique. Enseignement Math., 10, 267-270.
15. Cox, D., Little, J., O'Shea, D. (1992). Ideals, Varieties, and Algorithms. Springer Verlag. An Introduction to Computational Algebraic Geometry and Commutative Algebra.
16. Ekhad, S. B., Majewicz, J. E. (1996). A short WZ-style proof of Abel's identity. Electronic J. Combin., 3 (2). The Foata Festschrift.
17. Erdélyi, A. (1981). Higher Transcendental Functions, volume 1-2-3. R. E. Krieger publishing Company, Inc.
18. Fasenmyer, M. C. (1945). Some generalized hypergeometric polynomials. Ph. D. dissertation, University of Michigan.
19. Fasenmyer, M. C. (1947). Some generalized hypergeometric polynomials. Bull. Am. Math. Soc., 53, 806-812.
20. Fasenmyer, M. C. (1949). A note on pure recurrence relations. Am. Math. Monthly, 56, 14-17.
21. Faugère, J.-C., Gianni, P., Lazard, D., Mora, T. (1993). Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comput., 16, 329-344.
22. Galligo, A. (1985). Some algorithmic questions on ideals of differential operators. In Caviness, B. F., ed., Proceedings EUROCAL'85, vol. 204 of Lecture Notes in Computer Science, pp. 413-421. Springer Verlag.
23. Gasper, G., Rahman, M. (1990). Basic Hypergeometric Series, vol. 35 of Encyclopedia of Mathematics and its Applications. Cambridge University Press.
24. Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C. (1991). "One sugar cube, please" or selection strategies in the Buchberger algorithm. In Watt, S. M., ed., Symbolic and Algebraic Computation, pp. 49-54. ACM Press.
25. Kandri-Rody, A., Weispfenning, V. (1990). Non-commutative Gröbner bases in algebras of solvable type. J. Symb. Comput., 9, 1-26.
26. Kashiwara, M. (1978). On the holonomic systems of linear differential equations II. Invent. Math., 49, 121-135.
27. Koornwinder, T. H. (1993). On Zeilberger's algorithm and its q-analogue. J. Comput. Appl. Math., 48, 91-111.
28. Kredel, H. (1993). Solvable Polynomial Rings. Reihe Mathematik. Verlag Shaker, Aachen, Germany. After the Ph. D. thesis, ISBN 3-86111-342-2.
29. Lipshitz, L. (1988). The diagonal of a D-finite power series is D-finite. J. Algebra, 113, 373-378.
30. Lipshitz, L. (1989). D-finite power series. J. Algebra, 122, 353-373.
31. Mora, T. (1994). An introduction to commutative and noncommutative Gröbner bases. Theor. Comput. Sci., 134, 131-173.
32. Ore, O. (1933). Theory of non-commutative polynomials. Ann. Math., 34, 480-508.
33. Parnes, S., Ekhad, S. B. (1992). A WZ-style proof of Jacobi polynomials' generating function. Discrete Math., 110, 263-264.
34. Paule, P. (1994). Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type. Electronic J. Combin., 1 (R10), 1-9.
35. Paule, P., Riese, A. (1997). A Mathematica q-analogue of Zeilberger's algorithm based on an algebraically motivated approach to q-hypergeometric telescoping. In Fields Proceedings of the Workshop "Special Functions, q-Series and Related Topics", 12-23 June 1995, Toronto, Ontario. American Mathematical Society.
36. Paule, P., Schorn, M. (1995). A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities. J. Symb. Comput., 20, 673-698.
37. Petkovšek, M., Wilf, H., Zeilberger, D. (1996). A=B. A. K. Peters, Ltd.
38. Riese, A. (1996). A generalization of Gosper's algorithm to bibasic hypergeometric summation. Electronic J. Combin., 3(R19), 1-16.
39. Sabbah, C. (1993). Systèmes holonomes d'équations aux q-différences. In Kashiwara, M., Monteiro-Fernandes, T., Schapira, P., eds, D-Modules and Microlocal Geometry, pp. 125-147, Berlin. Walter de Gruyter & Co. Proceedings of the Conference D-Modules and Microlocal Geometry, Lisbon, 1990.
40. Salvy, B., Zimmermann, P. (1994). Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Soft., 20, 163-177. Also available as Technical Report 143, INRIA.
41. Stanley, R. P. (1980). Differentiably finite power series. Eur. J. Combin., 1, 175-188.
42. Strehl, V. (1994). Binomial identities - combinatorial and algorithmic aspects. Discrete Math., 136, 309-346.
43. Takayama, N. (1989). Gröbner basis and the problem of contiguous relations. Japan J. Appl. Math., 6, 147-160.
44. Takayama, N. (1990a). An algorithm of constructing the integral of a module - an infinite dimensional analog of Gröbner basis. In Symbolic and Algebraic Computation, pp. 206-211. ACM and Addison-Wesley. Proceedings of ISSAC'90, Kyoto.
45. Takayama, N. (1990b). Gröbner basis, integration and transcendental functions. In Symbolic and Algebraic Computation, pp. 152-156. ACM and Addison-Wesley. Proceedings ISSAC'90, Kyoto.
46. Takayama, N. (1992). An approach to the zero recognition problem by Buchberger algorithm. J. Symb. Comput., 14, 265-282.
47. Takayama, N. (1995). Private communication.
48. Takayama, N. (1996). Algorithm finding recurrence relations of binomial sums and its complexity. J. Symb. Comput., 20(5 and 6), 637-651.
49. Weispfenning, V. (1992). Finite Gröbner bases in non-Noetherian skew polynomial rings. In Wang, P. S., ed., Symbolic and Algebraic Computation, pp. 329-334, New York. ACM Press. Proceedings ISSAC'92, July 1992, Berkeley, California.
50. Wilf, H. S., Zeilberger, D. (1992a). An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral identities. Invent. Math., 108, 575-633.
51. Wilf, H. S., Zeilberger, D. (1992b). Rational function certification of multisum/integral/"q" identities. Bull. Am. Math. Soc., 27, 148-153.
52. Zeilberger, D. (1990a). A fast algorithm for proving terminating hypergeometric identities. Discrete Math., 80, 207-211.
53. Zeilberger, D. (1990b). A holonomic systems approach to special functions identities. J. Comput. Appl. Math., 32, 321-368.
54. Zeilberger, D. (1991a). A Maple program for proving hypergeometric identities. SIGSAM Bull., 25, 4-13.
55. Zeilberger, D. (1991b). The method of creative telescoping. J. Symb. Comput., 11, 195-204.