2015
DOI: 10.7153/jmi-09-49
|View full text |Cite
|
Sign up to set email alerts
|

Generalization of Levinson's inequality

Abstract: Abstract. Mercer [5] gave a generalization of Levinson's inequality that replaces the assumption of symmetry of the two sequences with a weaker assumptions of equality of variances. Witkowski [10] further loosened this assumption and extended the result to the class of 3-convex functions.We generalize these results to a newly defined, larger class of functions. We also prove the converse in case the function is continuous. In particular, we show that if Levinson's inequality holds under Mercer's assumptions, t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 14 publications
(20 citation statements)
references
References 0 publications
0
20
0
Order By: Relevance
“…It is obvious from the proof that Levinson's inequality (1.5) holds if the equality (2.1) is replaced by the weaker condition [3]), if, additionally, f is convex (resp. concave), this condition can be further weakened to Var(Y ) − Var(X) ≥ 0 (resp.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…It is obvious from the proof that Levinson's inequality (1.5) holds if the equality (2.1) is replaced by the weaker condition [3]), if, additionally, f is convex (resp. concave), this condition can be further weakened to Var(Y ) − Var(X) ≥ 0 (resp.…”
Section: Resultsmentioning
confidence: 99%
“…Baloch, Pečarić and Praljak ( [3]) also proved the converse of Levinson's inequality for continuous functions.…”
Section: Introductionmentioning
confidence: 91%
See 2 more Smart Citations
“…A property that explains the name of the class is the fact that a function is n-convex on an interval if and only if it is n-convex at every point of the interval (see [2,9]). Pečarić, Praljak and Witkowski in [9] studied necessary and sufficient conditions on two linear functionals A : C([a, c]) → R and B : C([c, b]) → R so that the inequality A(f ) ≤ B(f ) holds for every function f that is n-convex at c. In this section we will give inequalities of this type for particular linear functionals related to the inequalities obtained in the previous section.…”
Section: Theorem 5 Let All the Assumptions Of Theorem 2 Hold With Thmentioning
confidence: 99%