Abstract
AbstractWe prove two inequalities for the Mittag-Leffler function, namely that the function $$\log E_\alpha (x^\alpha )$$
log
E
α
(
x
α
)
is sub-additive for $$0<\alpha <1,$$
0
<
α
<
1
,
and super-additive for $$\alpha >1.$$
α
>
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,$$
0
<
α
<
2
,
we also show that $$E_\alpha (x^\alpha )$$
E
α
(
x
α
)
is log-concave resp. log-convex, using analytic as well as probabilistic arguments.
Publisher
Springer Science and Business Media LLC
Reference26 articles.
1. Biernacki, M., Krzyż, J.: On the monotonicity of certain functionals in the theory of analytic functions. Ann. Univ. Mariae Curie-Skłodowska A 9, 135–147 (1955)
2. Boedihardjo, H., Geng, X., Souris, N.P.: Path developments and tail asymptotics of signature for pure rough paths. Adv. Math. 364, 107043, 48 (2020)
3. Bruckner, A.M.: Some relationships between locally superadditive functions and convex functions. Proc. Am. Math. Soc. 15, 61–65 (1964)
4. Graduate Texts in Mathematics;JB Conway,1978
5. Crisan, D., Litterer, C., Lyons, T.J.: Kusuoka–Stroock gradient bounds for the solution of the filtering equation. J. Funct. Anal. 268, 1928–1971 (2015)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献