๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A conjecture concerning a completely monotonic function

โœ Scribed by E. Shemyakova; S.I. Khashin; D.J. Jeffrey

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
293 KB
Volume
60
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a Conjecture Concerning Monotonicity
On a Conjecture Concerning Monotonicity of Zeros of Ultraspherical Polynomials
โœ Dimitar K. Dimitrov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

Let C \* n , n=0, 1, ..., \*>&1ร‚2 be the ultraspherical (Gegenbauer) polynomials, orthogonal on (&1, 1) with respect to the weight (1&x 2 ) \*&1ร‚2 . Denote by `n, k (\*), k=1, ..., [nร‚2] the positive zeros of C \* n enumerated in decreasing order. The problem of finding the ``extremal'' function f f

A class of logarithmically completely mo
A class of logarithmically completely monotonic functions
โœ Senlin Guo; H.M. Srivastava ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

The main object of this work is to give some conditions for a class of functions to be logarithmically completely monotonic. Our result is shown to be an extension of a result which was proven in the recent literature on this subject.

A conjecture concerning Ramsey's theorem
A conjecture concerning Ramsey's theorem
โœ Martin Erickson ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

## P(c, m). If the edges of a countable injinite complete graph G are exactly c-colored, then there exists a countable infinite complete subgraph H of G whose edges are exactly m-colored. The purpose of this note is to inquire as to which pairs c, m of positive integers make P(c, m) a true stateme