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
Fingerprint Dive into the research topics of 'Some asymptotic bijections'. Together they form a unique fingerprint.
Cite this
Bender, E. A., & Zeilberger, D. (1985). Some asymptotic bijections. Journal of Combinatorial Theory, Series A, 38(1), 96-98. https://doi.org/10.1016/0097-3165(85)90029-9