Steffensen’s inequality deals with the comparison between integrals over a whole interval [a, b] and integrals over a subset of [a, b]. In this paper we prove an inequality which is similar to Steffensen’s inequality. The most general form of this inequality deals with integrals over a measure space. We also consider the discrete case.

In this paper, we discuss the existence and uniqueness of xed points for Banach and Kannancontractions dened on modular spaces endowed with a graph. We do not impose the Δ2-conditionor the Fatou property on the modular spaces to give generalizations of some recent results. Thegiven results play as a modular version of metric xed point results.

by using euler-maclaurin's summation formula and the way of real analysis, a more accurate multiplehilbert-type inequality and the equivalent form are given. we also prove that the same constantfactor in the equivalent inequalities is the best possible.

in this paper, some results of the chebyshev type integral inequality for the pseudo-integral are proven. the obtained results, are related to the measure of a level set of the maximum and the sum of two non-negative integrable functions. finally, we applied our results  to the case of comonotone functions.

We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b 6 x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

As an application of the improved Cauchy-Schwartz inequality due to Walker (Statist. Probab. Lett. (2017) 122:86-90), we obtain an improved version of the Cramer-Rao inequality for randomly censored data derived by Abdushukurov and Kim (J. Soviet. Math. (1987) pp. 2171-2185). We derive a lower bound of Bhattacharya type for the mean square error of a parametric function based on randomly censor...

Two simple proofs of the triangle inequality for the Jaccard distance in terms of nonnegative, monotone, submodular functions are given and discussed. The Jaccard index [8] is a classical similarity measure on sets with a lot of practical applications in information retrieval, data mining, machine learning, and many more (cf., e.g., [7]). Measuring the relative size of the overlap of two finite...