✦ LIBER ✦

On the position of a theorem of Kubilius in probabilistic number theory

✍ Scribed by P. D. T. A. Elliott

Publisher: Springer
Year: 1974
Tongue: English
Weight: 444 KB
Volume: 209
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01351849

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the erdos-wintner theorem of probabil

On the erdos-wintner theorem of probabilistic number theory

✍ Harold N. Shapiro 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

We would like to take this opportunity to express continuing respect and affection for our colleague, Harold Grad, on the occasion of his sixtieth birthday. Perhaps it is not inappropriate to apologize for the fact that this humble offering comes from the other side (the wrong side?) of the mathemat

Sums of multiplicative functions and lim

Sums of multiplicative functions and limit theorems in probabilistic number theory. I

✍ É. Manstavicius 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 602 KB

Sums of multiplicative functions and lim

Sums of multiplicative functions and limit theorems in probabilistic number theory. II

✍ E. Manstavičius 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 351 KB

On probabilistic limit theorems for a cl

On probabilistic limit theorems for a class of positive matrices

✍ L.A Klimko; L Sucheston 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 414 KB

On the fundamental metric theorems of ad

On the fundamental metric theorems of additive number theory

✍ Robert D Stalley 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 309 KB

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.