Enumerative combinatorics
A fast algorithm for proving terminating hypergeometric identities
Discrete Mathematics
A holonomic systems approach to special functions identities
Journal of Computational and Applied Mathematics
A Maple package for symmetric functions
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Non-commmutative elimination in ore algebras proves multivariate identities
Journal of Symbolic Computation
An extension of Zeilberger's fast algorithm to general holonomic functions
Discrete Mathematics
Concrete Math
A procedure for proving special function inequalities involving a discrete parameter
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Application of unspecified sequences in symbolic summation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We present an algorithm for proving certain families of nomial identities in which the number of variables appears as a parameter.Typically,indefinite sums and products (possibly nested)are used for defining such polynomial ties, but in principle the definition of the problem may be given in terms of arbitrary polynomial recurrences (possibly nonlinear). An implementation of our algorithm in Mat e-matica was able to verify identities appearing in textbooks, which, to our knowledge,were previously not accessible by any symbolic method. A collection of examples is included in the paper.