𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of the Eulerian numbers with a probabilistic application

✍ Scribed by Bernard Harris; C.J. Park

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
625 KB
Volume
20
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A probabilistically attained set of poly
A probabilistically attained set of polynomials that generate stirling numbers of the second kind
✍ Arthur J. Roth; Milton Sobel πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 734 KB

Using probabilistic arguments, we derive a sequence of polynomials in one variable which generate the Stirling numbers of the second kind. Specifically where S: is the desired Stirling number and P,\_,,,(\*> is the polynomial of degree c -m.

A Probabilistic lower bound on the indep
A Probabilistic lower bound on the independence number of graphs
✍ Stanley M. Selkow πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 124 KB

Caro (1979) and Wei (1981) established a bound on the size of an independent set of a graph as a function of its degrees. In case the degrees of each vertex's neighbors are also known, we establish a lower bound which is tighter for most graphs.