AbstractWe give explicitly recurrence relations satisfied by the connection coefficients between two families of the classical orthogonal polynomials of a discrete variable on a non-uniform lattice x(s) = q2s (i.e., the q-analogues of Charlier, Meixner, Krawtchouk and Hahn polynomials), in terms of the coefficients σ and τ of the Pearson equation satisfied by the weight function ρ, and the coefficients of the three-term recurrence relation and of two structure relations obeyed by these polynomials
We give four examples of families of orthogonal polynomials for which the coefficients in the recurr...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
We investigate new generalizations of the Meixner polynomials on the lattice N, on the shifted latti...
We obtain the structure relations for q-orthogonal polynomials in the expo-nential lattice q 2s and ...
We obtain the structure relations for q-orthogonal polynomials in the exponential lattice q 2s and f...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractWe give explicitly recurrence relations satisfied by the connection coefficients between two...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractWe describe a simple approach in order to build recursively the connection coefficients betw...
AbstractWe study polynomials orthogonal on a uniform grid. We show that each weight function gives t...
Let {$P_k$} be any sequence of classical orthogonal polynomials of a discrete variable. We give expl...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractIn this work, the coefficients of orthogonal polynomials are obtained in closed form. Our fo...
AbstractAn algorithmic approach is given to construct recurrence relations for the coefficients of t...
AbstractLet {Pk(x)} be any system of the classical orthogonal polynomials, and let {Pk(x; c)} be the...
We give four examples of families of orthogonal polynomials for which the coefficients in the recurr...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
We investigate new generalizations of the Meixner polynomials on the lattice N, on the shifted latti...
We obtain the structure relations for q-orthogonal polynomials in the expo-nential lattice q 2s and ...
We obtain the structure relations for q-orthogonal polynomials in the exponential lattice q 2s and f...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractWe give explicitly recurrence relations satisfied by the connection coefficients between two...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractWe describe a simple approach in order to build recursively the connection coefficients betw...
AbstractWe study polynomials orthogonal on a uniform grid. We show that each weight function gives t...
Let {$P_k$} be any sequence of classical orthogonal polynomials of a discrete variable. We give expl...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
AbstractIn this work, the coefficients of orthogonal polynomials are obtained in closed form. Our fo...
AbstractAn algorithmic approach is given to construct recurrence relations for the coefficients of t...
AbstractLet {Pk(x)} be any system of the classical orthogonal polynomials, and let {Pk(x; c)} be the...
We give four examples of families of orthogonal polynomials for which the coefficients in the recurr...
AbstractWe present a simple approach in order to compute recursively the connection coefficients bet...
We investigate new generalizations of the Meixner polynomials on the lattice N, on the shifted latti...