✦ LIBER ✦

Garsia and Milne's bijective proof of the inclusion-exclusion principle

✍ Scribed by Doron Zeilberger

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 139 KB
Volume: 51
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90028-1

No coin nor oath required. For personal study only.

✦ Synopsis

Although the following proof is implicit in Garsia and Milne's paper [I], it is scj elegant that we felt that it should be presented by itself for the benefit of the general mathematical public. The idea behind the proof was further exploited by Remmel [2] and Wilf [3].

📜 SIMILAR VOLUMES

Dynamic programming meets the principle

Dynamic programming meets the principle of inclusion and exclusion

✍ Richard M. Karp 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 273 KB

q-Analogs of the inclusion- exclusion pr

q-Analogs of the inclusion- exclusion principle and permutations with restricted position

✍ William Y.C. Chen; Gian-Carlo Rota 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 946 KB

We derive a q-analog of the principle of inclusion-exclusion, and use it to derive a q-analog of the Kaplansky-Riordan theory of permutations with restricted position. Some analogies with the theory of Mahonian statistics are pointed out at the end, leading to a conjectured relationship between the

A bijective proof of Muir's identity and

A bijective proof of Muir's identity and the Cauchy-Binet formula

✍ Jiang Zeng 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 185 KB