"Summation Algorithms for Stirling Number Identities"
, in Journal of Symbolic Computation, Vol. 42, Nummer 10, Seite(n) 948--970, 10-2007, ISSN: 0747-7171
Summation Algorithms for Stirling Number Identities
Sprache des Titels:
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.