Abstract
In this paper, we consider a two-dimensional model for finite set partitions which arises in conjunction with a special case of a general non-linear recurrence. We in- vestigate properties of some of the related counting sequences, including recurrences and generating functions. In particular, we obtain, by combinatorial arguments, some formulas relating these sequences to the Stirling numbers of the first kind. Specializing these arguments yields bijective proofs of some recent identities of Gould and Quain- tance involving the Bell numbers, which were established using algebraic methods.
Original language | English |
---|---|
Pages (from-to) | 1-17 |
Number of pages | 17 |
Journal | Journal of Integer Sequences |
Volume | 14 |
Issue number | 4 |
State | Published - 2011 |
Keywords
- Combinatorial proof
- Generating function
- Recurrence relation
- Set partition
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics