Abstract
The notion of an asymptotic bijection is introduced and used to give bijective proofs of infinite summation formulas for set partitions (Dobinski's formula) and involutions.
Original language | English (US) |
---|---|
Pages (from-to) | 96-98 |
Number of pages | 3 |
Journal | Journal of Combinatorial Theory, Series A |
Volume | 38 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1985 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics