✦ LIBER ✦

A short proof of the Oslo algorithm

✍ Scribed by Hartmut Prautzsch

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 73 KB
Volume: 1
Category: Article
ISSN: 0167-8396
DOI: 10.1016/0167-8396(84)90007-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A short proof of the lexical addressing

A short proof of the lexical addressing algorithm

✍ Mitchell Wand 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 391 KB

A short proof of an algorithm by Boehm

✍ Georg Kirrmann 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A new proof of the Garsia-Wachs algorith

A new proof of the Garsia-Wachs algorithm

✍ Feffrey H Kingston 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 305 KB

A Short Proof of the Littlewood–Richards

A Short Proof of the Littlewood–Richardson Rule

✍ V. Gasharov 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 73 KB

We give an involution type proof of the Littlewood-Richardson rule.

A short proof of the Chen-Manalastas the

A short proof of the Chen-Manalastas theorem

✍ J.A. Bondy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Gallai and Milgram (1960) proved that a digraph with stability number ct is spanned by ct disjoint directed paths. Chen and Manalastas Jr (1983) proved that a strong digraph with stability number at most two is spanned by at most two consistent directed circuits. We slightly simplify the proof of

A short proof of the Lagrange-Good formu

A short proof of the Lagrange-Good formula

✍ Josef Hofbauer 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 394 KB

A new proof of Good's generalization to several varia'Bles of the Lagrange inversion formula is given, which is mainly based on methods used in Roia's theory of polynomial sequences of binomial type.