Geometrically convex solutions of a generalized gamma functional equation

Convexity of real functions in one variable, generalizations (26A51) Gamma, beta and polygamma functions (33B15) Functional equations for real functions (39B22)

Review text

A function \(f:(0, \infty) \to (0, \infty)\) is called eventually geometrically convex if its restriction to an unbounded above interval \(I\) is geometrically convex, i.e., it satisfies the following inequality \[ f(x^\lambda y^{1-\lambda})\leq f(x)^\lambda f(y)^{1-\lambda},\qquad x,y\in I,\;\lambda \in [0, 1]. \] If this inequality is reversed, then we obtain the notion of eventual geometrical concavity. One of the two main results of this paper states that if \(f\) is eventually geometrically cocave and satisfies some additional assumptions, then there exists a unique eventually geometrically convex function \(g\) such that \(g(1)=1\) and \[ g(x+1)=f(x)g(x),\qquad x\in (0, \infty). \] Moreover, two formulae for \(g\) are given. Finally, two applications of the obtained outcomes are presented. One of them improves a result from \textit{D. Gronau} and \textit{J. Matkowski} [Result. Math. 26, No. 3--4, 290--297 (1994; Zbl 0876.39003)].

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Geometrically convex solutions of a generalized gamma functional equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354652)