Let $\mathcal {K}_u$ denote the class of all analytic functions f in the unit disk $\mathbb {D}:=\{z\in \mathbb {C}:|z|<1\}$, normalised by $f(0)=f'(0)-1=0$ and satisfying $|zf'(z)/g(z)-1|<1$ in $\mathbb {D}$ for some starlike function g. Allu, Sokól and Thomas [‘On a close-to-convex analogue of certain starlike functions’, Bull. Aust. Math. Soc. 108 (2020), 268–281] obtained a partial solution for the Fekete–Szegö problem and initial coefficient estimates for functions in $\mathcal {K}_u$, and posed a conjecture in this regard. We prove this conjecture regarding the sharp estimates of coefficients and solve the Fekete–Szegö problem completely for functions in the class $\mathcal {K}_u$.

We study the classical Hermite–Hadamard inequality in the matrix setting. This leads to a number of interesting matrix inequalities such as the Schatten p-norm estimates

$$ \begin{align*}\left(\|A^q\|_p^p + \|B^q\|_p^p\right)^{1/p} \le \|(xA+(1-x)B)^q\|_p+ \|((1-x)A+xB)^q\|_p, \end{align*} $$

$n\times n$

$A,B$

$0<q,x<1$

$X^*X+Y^*Y=XX^*+YY^*=I$

$$ \begin{align*}(X^*AX+Y^*BY)\oplus (Y^*AY+X^*BX) =\frac{1}{2n}\sum_{k=1}^{2n} U_k (A\oplus B)U_k^*, \end{align*} $$

$2n\times 2n$

$U_k$

In the framework of Bishop’s constructive mathematics we introduce co-convexity as a property of subsets B of ${\left\{ {0,1} \right\}^{\rm{*}}}$, the set of finite binary sequences, and prove that co-convex bars are uniform. Moreover, we establish a canonical correspondence between detachable subsets B of ${\left\{ {0,1} \right\}^{\rm{*}}}$ and uniformly continuous functions f defined on the unit interval such that B is a bar if and only if the corresponding function f is positive-valued, B is a uniform bar if and only if f has positive infimum, and B is co-convex if and only if f satisfies a weak convexity condition.

We prove the sharp inequality $|H_{3,1}(f)|\leq 4/135$ for convex functions, that is, for analytic functions $f$ with $a_{n}:=f^{(n)}(0)/n!,~n\in \mathbb{N}$, such that

$$\begin{eqnarray}Re\bigg\{1+\frac{zf^{\prime \prime }(z)}{f^{\prime }(z)}\bigg\}>0\quad \text{for}~z\in \mathbb{D}:=\{z\in \mathbb{C}:|z|<1\},\end{eqnarray}$$

$H_{3,1}(f)$

$$\begin{eqnarray}H_{3,1}(f):=\left|\begin{array}{@{}ccc@{}}a_{1} & a_{2} & a_{3}\\ a_{2} & a_{3} & a_{4}\\ a_{3} & a_{4} & a_{5}\end{array}\right|.\end{eqnarray}$$

In this paper, we introduce the definition of a convex real valued function $f$ defined on the set of integers, $\mathbb{Z}$ . We prove that $f$ is convex on $\mathbb{Z}$ if and only if ${{\Delta }^{2}}f\,\ge \,0$ on $\mathbb{Z}$ . As a first application of this new concept, we state and prove discrete Hermite–Hadamard inequality using the basics of discrete calculus (i.e., the calculus on $\mathbb{Z}$ ). Second, we state and prove the discrete fractional Hermite–Hadamard inequality using the basics of discrete fractional calculus. We close the paper by defining the convexity of a real valued function on any time scale.

Some bounds in terms of Gâteaux lateral derivatives for the weighted f-Gini mean difference generated by convex and symmetric functions in linear spaces are established. Applications for norms and semi-inner products are also provided.

Some inequalities in terms of the Gâteaux derivatives related to Jensen’s inequality for convex functions defined on linear spaces are given. Applications for norms, mean f-deviations and f-divergence measures are provided as well.

The quasilinearity of certain composite functionals defined on convex cones in linear spaces is investigated. Applications in refining the Jensen, Hölder, Minkowski and Schwarz inequalities are given.

A concept of synchronicity associated with convex functions in linear spaces and a Chebyshev type inequality are given. Applications for norms, semi-inner products and convex functions of several real variables are also given.

Some new results related to Jensen’s celebrated inequality for convex functions defined on convex sets in linear spaces are given. Applications for norm inequalities in normed linear spaces and f-divergences in information theory are provided as well.

In two recent papers a global upper bound is derived for Jensen’s inequality for weighted finite sums. In this paper we generalize this result on positive normalized functionals.

We give here some extensions of inequalities of Popoviciu and Rado. The idea is to use an inequality [C. P. Niculescu and L. E. Persson, Convex functions. Basic theory and applications (Universitaria Press, Craiova, 2003), Page 4] which gives an approximation of the arithmetic mean of n values of a given convex function in terms of the value at the arithmetic mean of the arguments. We also give more general forms of this inequality by replacing the arithmetic mean with others. Finally we use these inequalities to establish similar inequalities of Popoviciu and Rado type.

Let an almost everywhere positive function Φ be convex for p>1 and p<0, concave for p∈(0,1), and such that Axp≤Φ(x)≤Bxp holds on for some positive constants A≤B. In this paper we derive a class of general integral multidimensional Hardy-type inequalities with power weights, whose left-hand sides involve instead of , while the corresponding right-hand sides remain as in the classical Hardy’s inequality and have explicit constants in front of integrals. We also prove the related dual inequalities. The relations obtained are new even for the one-dimensional case and they unify and extend several inequalities of Hardy type known in the literature.

Nous prouvons un encadrement optimal pour la quantité $H\left( x,\,s \right)\,=\,\sum{_{n\ge 1}\,\frac{1}{{{\left( x+n \right)}^{s}}}}$ pour $x\,\ge \,0$ et $s\,>\,1$, qui améliore l'encadrement standard par des intégrales. Cet encadrement entraîne des inégalités sur la fonction $\zeta $ de Riemann, et amène à conjecturer la monotonie de la fonction $s\,\mapsto \,{{[(s\,-\,1)\text{ }\!\!\zeta\!\!\text{ (}s\text{)}]}^{\frac{1}{S-1}}}$. On donne des applications à l'étude de la convexité de fonctions liées à la fonction $\Gamma $ d'Euler et à la majoration optimale des fonctions élémentaires intervenant dans les opérateurs de Baskakov. Puis, nous étendons aux fonctions complètement monotones sur ]$0,\,+\infty $[ les résultats établis pour la fonction $x\,\mapsto \,{{x}^{-s}}$, et nous en déduisons des preuves élémentaires du comportement, quand $z$ tend vers 1, des séries génératrices de certaines fonctions arithmétiques. Enfin, nous prouvons qu'une partie du résultat se généralise à une classe de fonctions convexes positives décroissantes.

Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the σ-completion of J, and player TWO tries to cover the union of this sequence by playing one set at a time from J. We describe various conditions under which player TWO has a winning strategy that uses only information about the most recent k moves of ONE, and apply some of these results to the Banach-Mazurgame.

We study the relationships between Gateaux, Fréchet and weak Hadamard differentiability of convex functions and of equivalent norms. As a consequence we provide related characterizations of infinite dimensional Banach spaces and of Banach spaces containing ł1. Explicit examples are given. Some renormings of WCG Asplund spaces are made in this vein.

A device is subject to a sequence of shocks occurring randomly at times n = 1, 2, ⃛. At each point in time, shocks occur according to a Poisson distribution with parameter λ. Shocks cause damage and damage accumulates additively. They can cause the device to fail, and the probability of such a failure depends on the accumulated damage. Failure occurs because of shocks and can occur only at times n = 1, 2, ⃛. The device can be replaced before or at failure. If the device fails it is immediately replaced at a fixed cost. Replacement before failure can only occur at times n = 1, 2, ⃛, and is done at a lower cost depending on the amount of accumulated damage at replacement. In this paper we determine the optimal replacement policy that minimizes the expected cost per unit time.

Jensen gave a lower bound to Eρ(T), where ρ is a convex function of the random vector T. Madansky has obtained an upper bound via the theory of moment spaces of multivariate distributions. In particular, Madansky's upper bound is given explicitly when the components of T are independent random variables. For this case, lower and upper bounds are obtained in the paper, which uses additional information on T rather than its mean (mainly its expected absolute deviation about the mean) and hence gets closer to Eρ(T).

The importance of having improved bounds is illustrated through a nonlinear programming problem with stochastic objective function, known as the “wait and see” problem.

Two sharp lower bounds for the expectation of a function of a non-negative random variable are obtained under rather weak hypotheses regarding the function, thus generalizing two sharp upper bounds obtained by Brook for the moment generating function. The application of these bounds to economic risk analysis is discussed.