Riordan arrays and combinatorial sums
The concept of a Riordan array is used in a constructive way to find the generating function of many combinatorial sums. The generating function can then help us to obtain the closed form of the sum or its asymptotic value. Some examples of sums involving binomial coefficients and Stirling numbers a...
Saved in:
| Published in | Discrete mathematics Vol. 132; no. 1; pp. 267 - 290 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
15.09.1994
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | The concept of a Riordan array is used in a constructive way to find the generating function of many combinatorial sums. The generating function can then help us to obtain the closed form of the sum or its asymptotic value. Some examples of sums involving binomial coefficients and Stirling numbers are examined, together with an application of Riordan arrays to some walk problems. |
|---|---|
| ISSN: | 0012-365X 1872-681X |
| DOI: | 10.1016/0012-365X(92)00570-H |