2007
DOI: 10.1016/j.cam.2006.01.007
|View full text |Cite
|
Sign up to set email alerts
|

Second structure relation for semiclassical orthogonal polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…Now, we recall and generalize some results concerning the finite‐type relations. It can be considered and used to establish characterizations of classical and semi‐classical polynomials , , , . First, let Pnn0 and Rnn0 be sequences of monic polynomials with unn0 and wnn0 their respective dual sequences, the following formula always holds: ϕ(x)Rn(x)=ν=0n+tλn,vPν(x),n0,where λn,v=uv,ϕRn, 0vn+t, n0.Definition When there is an integer s0 such that we shall say that is a finite‐type relation between Pnn0 and Rnn0, with respect to ϕ. Lemma For any sequence Pnn0 compatible with ϕ, degϕ<...>…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Now, we recall and generalize some results concerning the finite‐type relations. It can be considered and used to establish characterizations of classical and semi‐classical polynomials , , , . First, let Pnn0 and Rnn0 be sequences of monic polynomials with unn0 and wnn0 their respective dual sequences, the following formula always holds: ϕ(x)Rn(x)=ν=0n+tλn,vPν(x),n0,where λn,v=uv,ϕRn, 0vn+t, n0.Definition When there is an integer s0 such that we shall say that is a finite‐type relation between Pnn0 and Rnn0, with respect to ϕ. Lemma For any sequence Pnn0 compatible with ϕ, degϕ<...>…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…Now, we recall and generalize some results concerning the finite-type relations. It can be considered and used to establish characterizations of classical and semi-classical polynomials [34], [41], [42], [35]. First, let {P n } n≥0 and {R n } n≥0 be sequences of monic polynomials with {u n } n≥0 and {w n } n≥0 their respective dual sequences, the following formula always holds:…”
Section: Finite-type Relationsmentioning
confidence: 99%
“…Furthermore, there exist some extensions to the semi-classical situation [14]. The general theory of the structure relation for Askey-Wilson polynomials was presented by Koornwinder in [9].…”
Section: Introductionmentioning
confidence: 98%
“…where P [1] n = P ′ n+1 /(n + 1), n ≥ 0 (see [8,18]). Recently, in [16], it was formulated the structure relation 2σ k=0 ξ n,k P n+σ−k (x) = σ+t k=0 ς n,k P [1] n+σ−k (x) , n ≥ max{t + 1, σ} , that, under certain conditions, establishes the semiclassical character of orthogonal polynomial sequences {P n }, and which generalizes the above mentioned second structure relation for classical orthogonal polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…A theme of research in the theory of orthogonal polynomials is the characterization of orthogonal polynomial sequences satisfying a given structure relation. In this issue we refer the reader to [1,2], [4]- [8], [16]- [19] (see also [13], one of the first papers formulating inverse problems for orthogonal polynomials).…”
Section: Introductionmentioning
confidence: 99%