Computer proofs for polynomial identities in arbitrary many variables

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 199-204

  Kauers, Manuel ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Computer proofs; Polynomial identities

Indexed keywords

ALGORITHMS; COMPUTER AIDED ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPUTER PROOFS; POLYNOMIAL IDENTITIES; POLYNOMIAL RECURRENCES; TEXTBOOKS;

POLYNOMIALS;

EID: 27644437692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005315     Document Type: Conference Paper

References (15)

1. G. E. Andrews, R. Askey, and R. Roy. Special Functions, volume 71 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1999.
2. F. Chyzak. An extension of Zeilberger's fast algorithm to general holonomic functions. Discrete Mathematics, 217:115-134, 2000.
3. F. Chyzak and B. Salvy. Non-commutative elimination in Ore algebras proves multivariate identities. Journal of Symbolic Computation, 26:187-227, 1998.
4. R. M. Cohn. Difference Algebra. Interscience Publishers, John Wiley & Sons, 1965.
5. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, second edition, 1994.
6. M. Kauers. An algorithm for deciding zero equivalence of nested polynomially recurrent sequences. Technical Report 2003-48, SFB F013, Johannes Kepler Universität, 2003. (submitted).
7. I. G. MacDonald. Symmetric Functions and Orthogonal Polynomials. American Mathematical Society, 1998.
8. O. Perron. Die Lehre von den Kettenbrüchen. Chelsea Publishing Company, second edition, 1929.
9. M. Petkovšek, H. Wilf, and D. Zeilberger. A = B. AK Peters, Ltd., 1997.
10. C. Scheider. Symbolic Summation in Difference Fields. PhD thesis, RISC-Linz, Johannes Kepler Universität Linz, 2001.
11. R. P. Stanley. Enumerative Combinatorics, Volume 2. Cambridge Studies in Advanced Mathematics 62. Cambridge University Press, 1999.
12. J. R. Stembridge. A Maple package for symmetric functions. Journal of Symbolic Computation, 20:755-768, 1995.
13. D. Zeilberger. A fast algorithm for proving terminating hypergeometric identities. Discrete Mathematics, 80:207-211, 1990.
14. D. Zeilberger. A holonomic systems approach to special functions. Journal of Computational and Applied Mathematics, 32:321-368, 1990.
15. D. Zeilberger. WZ Theory. Chapter II. In MSRI Workshop on Symbolic Computation in Geometry and Analysis, 1998. Transcript available at http://www.math.rutgers.edu/~zeilberg/.