2003
DOI: 10.1142/s0219530503000120
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Analogues of the Laguerre Inequality

Abstract: It is shown that

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
14
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 11 publications
(15 citation statements)
references
References 16 publications
1
14
0
Order By: Relevance
“…In the discrete case the only previously known results going beyond the first order bounds were obtained for the binary Krawtchouk and the Charlier polynomials [5,6]. Here we improve slightly these inequalities and establish similar results for the rest of the cases.…”
Section: Introductionsupporting
confidence: 75%
See 1 more Smart Citation
“…In the discrete case the only previously known results going beyond the first order bounds were obtained for the binary Krawtchouk and the Charlier polynomials [5,6]. Here we improve slightly these inequalities and establish similar results for the rest of the cases.…”
Section: Introductionsupporting
confidence: 75%
“…We also assume that A(x) and B(x) are continuous functions on L. It seems that the following easy to prove general result has been noticed only recently [5], although the corresponding statements for binary Krawtchouk and Hahn polynomials were known for a long time [1,12]. Theorem 1.…”
Section: General Resultsmentioning
confidence: 98%
“…Our main tools are the following inequalities established in [11], which are the discrete analogue of the generalization of the Laguerre inequality given by Jensen [7] and rediscovered by Patrick [15], [16].…”
Section: Inequalitiesmentioning
confidence: 99%
“…First of all notice that by (10) one can express p(x + j) as a linear combination of p(x + 1) and p(x) with coefficients depending on x. Choosing either (11) or (14), depending on the mesh, and putting t = t(x) = p(x + 1)/p(x), one obtains a nonnegative expression…”
Section: Corollary 2 Each Branch Of the Function Tmentioning
confidence: 99%
See 1 more Smart Citation