We consider a class of sequences defined by triangular recurrence equations. This class contains Stirling numbers and Eulerian numbers of both kinds, and hypergeometric multiples of those. We give a sufficient criterion for sums over such sequences to obey a recurrence equation, and present algorithms for computing such recurrence equations efficiently. Our algorithms can be used for verifying many known summation identities about Stirling numbers instantly, and also for discovering new identities.
| Original language | English |
|---|
| Place of Publication | Johannes Kepler University Linz, Altenbergerstraße 69, 4040 Linz, Austria |
|---|
| Publisher | SFB F013 |
|---|
| Number of pages | 23 |
|---|
| Publication status | Published - 2007 |
|---|
| Name | SFB F013 Reports |
|---|
| No. | 2007-11 |
|---|
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics