✦ LIBER ✦

Generalizations of the ballot problem

✍ Scribed by Ora Engelberg

Publisher: Springer
Year: 1965
Tongue: English
Weight: 225 KB
Volume: 3
Category: Article
ISSN: 1432-2064
DOI: 10.1007/bf00535777

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of polynomials in th

On a generalization of polynomials in the ballot problem

✍ Toshihiro Watanabe 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 486 KB

q-generalization of a ballot problem

✍ C. Krattenthaler; S.G. Mohanty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 721 KB

n-dimensional lattice paths which do not touch the hyperplanes xi-xi + I = -1, i = 1,2, , n -1, and x,-x1 = -1 -K arc enumerated by certain statistics, one of which is MacMahon's major index, the others being variations of it. By a reflection-like proof, a formula involving determinants is obtained.

The ballot problem

✍ M.S. Klamkin; A. Rhemtulla 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 349 KB

The ballot problem

✍ Barry A. Cipra 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 225 KB

Andre's reflection proof generalized to

Andre's reflection proof generalized to the many-candidate ballot problem

✍ Doron Zeilberger 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 81 KB

Some generalizations of the steiner prob

Some generalizations of the steiner problem in graphs

✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning