In combinatorial mathematics, the q-difference polynomials or q-harmonic polynomials are a polynomial sequence defined in terms of the q-derivative. They are a generalized type of Brenke polynomial, and generalize the Appell polynomials. See also Sheffer sequence.

Definition

edit

The q-difference polynomials satisfy the relation

where the derivative symbol on the left is the q-derivative. In the limit of , this becomes the definition of the Appell polynomials:

Generating function

edit

The generalized generating function for these polynomials is of the type of generating function for Brenke polynomials, namely

where is the q-exponential:

Here, is the q-factorial and

is the q-Pochhammer symbol. The function is arbitrary but assumed to have an expansion

Any such gives a sequence of q-difference polynomials.

References

edit
  • A. Sharma and A. M. Chak, "The basic analogue of a class of polynomials", Riv. Mat. Univ. Parma, 5 (1954) 325–337.
  • Ralph P. Boas, Jr. and R. Creighton Buck, Polynomial Expansions of Analytic Functions (Second Printing Corrected), (1964) Academic Press Inc., Publishers New York, Springer-Verlag, Berlin. Library of Congress Card Number 63-23263. (Provides a very brief discussion of convergence.)

📚 Artikel Terkait di Wikipedia

Newton polynomial

Newton's divided differences interpolation polynomial because the coefficients of the polynomial are calculated using Newton's divided differences method. Given

List of q-analogs

q-derivative q-difference polynomial Quantum calculus LLT polynomial q-binomial coefficient q-Pochhammer symbol q-Vandermonde identity q-Bessel polynomials q-Charlier

Q-derivative

when q → 1 {\displaystyle q\to 1} it reduces to forward difference. This is a successful tool for constructing families of orthogonal polynomials and investigating

Polynomial greatest common divisor

GCD or gcd) of two polynomials is a polynomial, of the highest possible degree, which is a factor of both the two original polynomials. This concept is

Finite difference

any further pairwise differences will have the value 0. Let Q(x) be a polynomial of degree 1: Δ h [ Q ] ( x ) = Q ( x + h ) − Q ( x ) = [ a ( x + h )

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given data set by the polynomial of lowest possible degree that passes through

Degree of a polynomial

In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials (individual terms) with non-zero coefficients. The

Delta operator

linear operator Q : K [ x ] ⟶ K [ x ] {\displaystyle Q\colon \mathbb {K} [x]\longrightarrow \mathbb {K} [x]} on the vector space of polynomials in a variable