An Extension of Raşa’s Conjecture to q-Monotone Functions

We extend an inequality involving the Bernstein basis polynomials and convex functions on [0, 1]. The inequality was originally conjectured by Raşa about thirty years ago, but was proved only recently. Our extension provides an inequality involving q-monotone functions, $$q\in \mathbb N$$ q ∈ N . In particular, 1-monotone functions are nondecreasing functions, and 2-monotone functions are convex functions. In general, q-monotone functions on [0, 1], for $$q\ge 2$$ q ≥ 2 , possess a $$(q-2)$$ ( q - 2 ) nd derivative in (0, 1), which is convex there. We also discuss some other linear positive approximation processes.

Measure Differential Inclusions: Existence Results and Minimum Problems

We focus on a very general problem in the theory of dynamic systems, namely that of studying measure differential inclusions with varying measures. The multifunction on the right hand side has compact non-necessarily convex values in a real Euclidean space and satisfies bounded variation hypotheses with respect to the Pompeiu excess (and not to the Hausdorff-Pompeiu distance, as usually in literature). This is possible due to the use of interesting selection principles for excess bounded variation set-valued mappings. Conditions for the minimization of a generic functional with respect to a family of measures generated by equiregulated left-continuous, nondecreasing functions and to associated solutions of the differential inclusion driven by these measures are deduced, under constraints only on the initial point of the trajectory.

On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Nondecreasing Functions on Closed Intervals

We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work. Specifically, our main result shows that D-iteration converges faster than P-iteration and SP-iteration to the fixed point. Consequently, we have that D-iteration converges faster than the others under the same computational cost. Moreover, the analogue of their convergence theorem holds for D-iteration.

Generalizations of Steffensen’s inequality via the extension of Montgomery identity

In this paper, we obtained new generalizations of Steffensen’s inequality for n-convex functions by using extension of Montgomery identity via Taylor’s formula. Since 1-convex functions are nondecreasing functions, new inequalities generalize Stefensen’s inequality. Related Ostrowski type inequalities are also provided. Bounds for the reminders in new identities are given by using the Chebyshev and Grüss type inequalities.

On the existence results for a class of singular elliptic system involving indefinite weight functions and asymptotically linear growth forcing term

In this work, we study the existence of positive solutions to the singular system$$\left\{\begin{array}{ll}-\Delta_{p}u = \lambda a(x)f(v)-u^{-\alpha} & \textrm{ in }\Omega,\\-\Delta_{p}v = \lambda b(x)g(u)-v^{-\alpha} & \textrm{ in }\Omega,\\u = v= 0 & \textrm{ on }\partial \Omega,\end{array}\right.$$where $\lambda $ is positive parameter, $\Delta_{p}u=\textrm{div}(|\nabla u|^{p-2} \nabla u)$, $p>1$, $ \Omega \subset R^{n} $ some for $ n >1 $, is a bounded domain with smooth boundary $\partial \Omega $ , $ 0<\alpha< 1 $, and $f,g: [0,\infty] \to\R$ are continuous, nondecreasing functions which are asymptotically $ p $-linear at $\infty$. We prove the existence of a positive solution for a certain range of $\lambda$ using the method of sub-supersolutions.

USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable functions. The corresponding randomness notions are slightly stronger than Martin–Löf (ML) randomness.We establish several equivalences. Given a ML-random realz, the additional randomness strengths needed for the following are equivalent.(1)all effectively closed classes containingzhave density 1 atz.(2)all nondecreasing functions with uniformly left-c.e. increments are differentiable atz.(3)zis a Lebesgue point of each lower semicomputable integrable function.We also consider convergence of left-c.e. martingales, and convergence in the sense of Birkhoff’s pointwise ergodic theorem. Lastly, we study randomness notions related to density of${\rm{\Pi }}_n^0$and${\rm{\Sigma }}_1^1$classes at a real.