Computer Science – Symbolic Computation
Scientific paper
2008-08-19
Computer Science
Symbolic Computation
To appear in Annals of Combinatorics
Scientific paper
Usually creative telescoping is used to derive recurrences for sums. In this article we show that the non-existence of a creative telescoping solution, and more generally, of a parameterized telescoping solution, proves algebraic independence of certain types of sums. Combining this fact with summation-theory shows transcendence of whole classes of sums. Moreover, this result throws new light on the question why, e.g., Zeilberger's algorithm fails to find a recurrence with minimal order.
No associations
LandOfFree
Parameterized Telescoping Proves Algebraic Independence of Sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parameterized Telescoping Proves Algebraic Independence of Sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Telescoping Proves Algebraic Independence of Sums will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-132195