Finding telescopers with minimal depth for indefinite nested sum and product expressions
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
Summation in finite terms using sage
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
An important application of solving parameterized linear difference equations in ΠΣ-fields, a very general class of difference fields, is simplifying and proving of nested multisum expressions and identities. Together with other reduction techniques described elsewhere, the algorithms considered in this article can be used to search for all solutions of such difference equations. More precisely, within a typical reduction step one often is faced with subproblems to find all solutions of linear difference equations where the solutions live in a polynomial ring. The algorithms under consideration deliver degree bounds for these polynomial solutions.