Kesidis, G, Konstantopoulos, T and Zazanis, MA
(2018)
The generating functions of stirling numbers of the second kind derived probabilistically.
Mathematical Scientist, 43 (2).
pp. 82-87.
|
Text
t1871b.pdf - Author Accepted Manuscript Download (75kB) | Preview |
Abstract
Stirling numbers of the second kind, S(n, r), denote the number of partitions of a finite set of size n into r disjoint nonempty subsets. The aim of this short article is to shed some light on the generating functions of these numbers by deriving them probabilistically. We do this by linking them to Markov chains related to the classical coupon collector problem; coupons are collected in discrete time (ordinary generating function) or in continuous time (exponential generating function). We also review the shortest possible combinatorial derivations of these generating functions.
| Item Type: | Article |
|---|---|
| Depositing User: | Symplectic Admin |
| Date Deposited: | 21 May 2019 11:40 |
| Last Modified: | 19 Jan 2023 00:43 |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3042227 |
Share
Share
