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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Cite this
}
Some asymptotic bijections. / Bender, Edward A.; Zeilberger, Doron.
In: Journal of Combinatorial Theory, Series A, Vol. 38, No. 1, 01.1985, p. 96-98.Research output: Contribution to journal › Article
TY - JOUR
T1 - Some asymptotic bijections
AU - Bender, Edward A.
AU - Zeilberger, Doron
PY - 1985/1
Y1 - 1985/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0042368663&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0042368663&partnerID=8YFLogxK
U2 - 10.1016/0097-3165(85)90029-9
DO - 10.1016/0097-3165(85)90029-9
M3 - Article
AN - SCOPUS:0042368663
VL - 38
SP - 96
EP - 98
JO - Journal of Combinatorial Theory - Series A
JF - Journal of Combinatorial Theory - Series A
SN - 0097-3165
IS - 1
ER -