نتایج جستجو برای: ‎Kravchuk and Charlier‎ ‎polynomials

تعداد نتایج: 16837124  

Journal: :Math. Comput. 2013
Iván Area Dimitar K. Dimitrov Eduardo Godoy Vanessa G. Paschoa

In this paper we obtain sharp bounds for the zeros of classical orthogonal polynomials of a discrete variable, considered as functions of a parameter, by using a theorem of A. Markov and the so-called HellmannFeynman theorem. Comparisons with previous results for zeros of Hahn, Meixner, Kravchuk and Charlier polynomials are also presented.

2013
A. Jooste K. Jordaan

The zeros of certain different sequences of orthogonal polynomials interlace in a well-defined way. The study of this phenomenon and the conditions under which it holds lead to a set of points that can be applied as bounds for the extreme zeros of the polynomials. We consider different sequences of the discrete orthogonal Meixner and Kravchuk polynomials and use mixed three term recurrence rela...

2017
G. Stacey Staples

Kravchuk polynomials arise as orthogonal polynomials with respect to the binomial distribution and have numerous applications in harmonic analysis, statistics, coding theory, and quantum probability. The relationship between Kravchuk polynomials and Clifford algebras is multifaceted. In this paper, Kravchuk polynomials are discovered as traces of conjugation operators in Clifford algebras, and ...

2008
Ira M. Gessel Pallavi Jayawant

Charlier configurations provide a combinatorial model for Charlier polynomials. We use this model to give a combinatorial proof of a multilinear generating function for Charlier polynomials. As special cases of the multilinear generating function, we obtain the bilinear generating function for Charlier polynomials and formulas for derangements.

Journal: :Journal of Approximation Theory 2014
Antonio J. Durán Guardeño

Using Casorati determinants of Charlier polynomials (ca n )n , we construct for each finite set F of positive integers a sequence of polynomials cF n , n ∈ σF , which are eigenfunctions of a second order difference operator, where σF is certain infinite set of nonnegative integers, σF ( N. For suitable finite sets F (we call them admissible sets), we prove that the polynomials cF n , n ∈ σF , a...

1999
MIGUEL LORENTE M. LORENTE

We develop general expressions for the raising and lowering operators that belong to the orthogonal polynomials of hypergeometric type with discrete and continuous variable. We construct the creation and annihilation operators that correspond to the normalized polynomials and study their algebraic properties in the case of the Kravchuk/Hermite Meixner/Laguerre polynomials. 1. Introduction. In a...

Journal: :Ukrainian Mathematical Journal 2014

2003
Natig M. Atakishiyev

The aim of this paper is to derive (by using two operators, representable by a Jacobi matrix) a family of q-orthogonal polynomials, which turn to be dual to alternative q-Charlier polynomials. A discrete orthogonality relation and a three-term recurrence relation for these dual polynomials are explicitly obtained. The completeness property of dual alternative q-Charlier polynomials is also esta...

Journal: :IJPRAI 2011
Hongqing Zhu Min Liu Yu Li Huazhong Shu Hui Zhang

This paper presents two new sets of nonseparable discrete orthogonal Charlier and Meixner moments describing the images with noise and that are noise-free. The basis functions used by the proposed nonseparable moments are bivariate Charlier or Meixner polynomials introduced by Tratnik et al. This study discusses the computational aspects of discrete orthogonal Charlier and Meixner polynomials, ...

Journal: :Journal of Approximation Theory 2008
D. W. Lee

For discrete multiple orthogonal polynomials such as the multiple Charlier polynomials, the multiple Meixner polynomials, and the multiple Hahn polynomials, we first find a lowering operator and then give a (r + 1)th order difference equation by combining the lowering operator with the raising operator. As a corollary, explicit third order difference equations for discrete multiple orthogonal p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید