کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
401684 675426 2007 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Summation algorithms for Stirling number identities
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Summation algorithms for Stirling number identities
چکیده انگلیسی

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 on Stirling numbers instantly, and also for discovering new identities.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 42, Issue 10, October 2007, Pages 948-970