𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bijective proof of an identity for noncrossing graphs

✍ Scribed by Pavel Podbrdský


Book ID
108315834
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
98 KB
Volume
260
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A bijective proof of Cassini's fibonacci
✍ M. Werman; D. Zeilberger 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 42 KB

can be easily proved by either induction, Binet's formula, or ([1, p. 80]) by taking determinants in In this paper we give a bijective proof, based upon the following combinatorial interpretation of the Fibonacci numbers. Proposition. Let A(n) = {(al, • • • , at); r >I O, ai = 1 or 2, a I +''' + a~