Sheffer sequence

Sheffer sequence

In mathematics, a Sheffer sequence is a polynomial sequence, i.e., a sequence { "p""n"("x") : "n" = 0, 1, 2, 3, ... } of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are named for Isadore M. Sheffer.

Definition

Fix a polynomial sequence "p""n". Define a linear operator "Q" on polynomials in "x" by

:Qp_n(x) = np_{n-1}(x), .

This determines "Q" on all polynomials. The polynomial sequence "p""n" is a "Sheffer sequence" if the linear operator "Q" just defined is "shift-equivariant". Here we define a linear operator "Q" on polynomials to be "shift-equivariant" if whenever "f"("x") = "g"("x" + "a") is a "shift" of "g"("x"), then ("Qf")("x") = ("Qg")("x" + "a"), i.e., "Q" commutes with every "shift operator". Such a "Q" is a delta operator.

Properties

The set of all Sheffer sequences is a group under the operation of umbral composition of polynomial sequences, defined as follows. Suppose { "p""n"(x) : "n" = 0, 1, 2, 3, ... } and { "q""n"(x) : "n" = 0, 1, 2, 3, ... } are polynomial sequences, given by

:p_n(x)=sum_{k=0}^n a_{n,k}x^k mbox{and} q_n(x)=sum_{k=0}^n b_{n,k}x^k.

Then the umbral composition p circ q is the polynomial sequence whose "n"th term is

:(p_ncirc q)(x)=sum_{k=0}^n a_{n,k}q_k(x)=sum_{0le k le ell le n} a_{n,k}b_{k,ell}x^ell

(the subscript "n" appears in "p""n", since this is the "n" term of that sequence, but not in "q", since this refers to the sequence as a whole rather than one of its terms).

The neutral element of this group is the standard monomial basis

:e_n(x) = x^n = sum_{k=0}^n delta_{n,k} x^k.

Two important subgroups are the group of Appell sequences, which are those sequences for which the operator "Q" is mere differentiation, and the group of sequences of binomial type, which are those that satisfy the identity:p_n(x+y)=sum_{k=0}^n{n choose k}p_k(x)p_{n-k}(y).A Sheffer sequence { "pn"("x"): "n" = 0, 1, 2, ... } is of binomial type if and only if both

:p_0(x) = 1,

and

:p_n(0) = 0mbox{ for } n ge 1. ,

The group of Appell sequences is abelian; the group of sequences of binomial type is not. The group of Appell sequences is a normal subgroup; the group of sequences of binomial type is not. The group of Sheffer sequences is a semidirect product of the group of Appell sequences and the group of sequences of binomial type. It follows that each coset of the group of Appell sequences contains exactly one sequence of binomial type. Two Sheffer sequences are in the same such coset if and only if the operator "Q" described above – called the "delta operator" of that sequence – is the same linear operator in both cases. (Generally, a "delta operator" is a shift-equivariant linear operator on polynomials that reduces degree by one. The term is due to F. Hildebrandt.)

If "sn"("x") is a Sheffer sequence and "pn"("x") is the one sequence of binomial type that shares the same delta operator, then

:s_n(x+y)=sum_{k=0}^n{n choose k}p_k(x)s_{n-k}(y).

Sometimes the term "Sheffer sequence" is "defined" to mean a sequence that bears this relation to some sequence of binomial type.In particular, if { "sn"("x") } is an Appell sequence, then

:s_n(x+y)=sum_{k=0}^n{n choose k}x^ks_{n-k}(y).

The sequence of Hermite polynomials, the sequence of Bernoulli polynomials, and the monomials { "xn" : "n" = 0, 1, 2, ... } are examples of Appell sequences.

A Sheffer sequence "p""n" is characterised by its exponential generating function

: sum_{n=0}^infty frac{p_n(x)}{n!} t^n = A(t) exp(x B(t)) ,

where "A" and "B" are (formal) power series in "t". Sheffer sequences are thus examples of generalized Appell polynomials and hence have an associated recurrence relation.

Examples

Examples of polynomial sequences which are Sheffer sequences include:
* The Hermite polynomials;
* The Bernoulli polynomials;
* The monomials { "xn" : "n" = 0, 1, 2, ... } ;
* The Laguerre polynomials;
* The Abel polynomials;
* The central factorial polynomials.

Some of the results above first appeared in the paper referred to below.

ee also

* Bernstein-Sato polynomial

References

* Reprinted in the next reference.
*
*
*

External links

* [http://mathworld.wolfram.com/ShefferSequence.html Sheffer Sequence] at MathWorld


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Appell sequence — In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence { p n ( x )} n = 0, 1, 2, ... satisfying the identity:{d over dx} p n(x) = np {n 1}(x),and in which p 0( x ) is a non zero constant.ExamplesAmong the… …   Wikipedia

  • Polynomial sequence — In mathematics, a polynomial sequence is a sequence of polynomials indexed by the nonnegative integers 0, 1, 2, 3, ..., in which each index is equal to the degree of the corresponding polynomial. Examples * Monomials * Rising factorials * Falling …   Wikipedia

  • Binomial type — In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by { 0, 1, 2, 3, ... } in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities:p n(x+y)=sum… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Umbral calculus — In mathematics before the 1970s, the term umbral calculus was understood to mean the surprising similarities between otherwise unrelated polynomial equations, and certain shadowy techniques that can be used to prove them. These techniques were… …   Wikipedia

  • Calcul ombral — En mathématiques, le calcul ombral est le nom d un ensemble de techniques de calcul formel qui, avant les années 1970, était plutôt appelé en français calcul symbolique. Il s agit de l étude des similarités surprenantes entre certaines formules… …   Wikipédia en Français

  • Hermite polynomials — In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence that arise in probability, such as the Edgeworth series; in combinatorics, as an example of an Appell sequence, obeying the umbral calculus; in numerical… …   Wikipedia

  • Orthogonal polynomials — In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product. The most widely used orthogonal polynomials are the… …   Wikipedia

  • Classical orthogonal polynomials — In mathematics, the classical orthogonal polynomials are the most widely used orthogonal polynomials, and consist of the Hermite polynomials, the Laguerre polynomials, the Jacobi polynomials together with their special cases the ultraspherical… …   Wikipedia

  • Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”