| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651407 | Discrete Mathematics | 2006 | 11 Pages |
Abstract
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n)x(n). More than that, we show how to extend Karr's algorithm to a general summation framework by which additional types of summand expressions can be handled. Our treatment of unspecified sequences can be seen as a first illustrative application of this approach.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Manuel Kauers, Carsten Schneider,