We characterize the complete monotonicity of the Kilbas-Saigo function on the negative half-line. We also provide the exact asymptotics at , and uniform hyperbolic bounds are derived. The same questions are addressed for the classical Le Roy function. The main ingredient for the proof is a probabilistic representation of these functions in terms of the stable subordinator.
We give some necessary and some sufficient conditions for the complete monotonicity on the negative half-line of a Mittag–Leffler function of Le Roy type. It is conjectured that the underlying positive random variable, when it exists, must be logarithmically infinitely divisible.
We prove two inequalities for the Mittag-Leffler function, namely that the function $$\log E_\alpha (x^\alpha )$$ is sub-additive for $$0<\alpha <1,$$ and super-additive for $$\alpha >1.$$ These assertions follow from two new binomial inequalities, one of which is a converse to the neo-classical inequality. The proofs use a generalization of the binomial theorem due to Hara and Hino (Bull London Math Soc 2010). For $$0<\alpha <2,$$ we also show that $$E_\alpha (x^\alpha )$$ is log-concave resp. log-convex, using analytic as well as probabilistic arguments.