Some asymptotic bijections

Edward A. Bender, Doron Zeilberger

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish (US)
Pages (from-to)96-98
Number of pages3
JournalJournal of Combinatorial Theory, Series A
Volume38
Issue number1
DOIs
StatePublished - Jan 1985
Externally publishedYes

Fingerprint

Set Partition
Summation Formula
Bijective
Bijection
Involution

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

Bender, Edward A. ; Zeilberger, Doron. / Some asymptotic bijections. In: Journal of Combinatorial Theory, Series A. 1985 ; Vol. 38, No. 1. pp. 96-98.
@article{a0fb4ca2806647fd82062bcec3455cd5,
title = "Some asymptotic bijections",
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.",
author = "Bender, {Edward A.} and Doron Zeilberger",
year = "1985",
month = "1",
doi = "10.1016/0097-3165(85)90029-9",
language = "English (US)",
volume = "38",
pages = "96--98",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "1",

}

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 journalArticle

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 -