- Sheffer sequence
In
mathematics , a Sheffer sequence is apolynomial sequence , i.e., a sequence { "p""n"("x") : "n" = 0, 1, 2, 3, ... } ofpolynomial s in which the index of each polynomial equals its degree, satisfying conditions related to theumbral calculus in combinatorics. They are named forIsadore M. Sheffer .Definition
Fix a polynomial sequence "p""n". Define a linear operator "Q" on polynomials in "x" by
:
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
:
Then the umbral composition is the polynomial sequence whose "n"th term is
:
(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
:
Two important subgroups are the group of
Appell sequence s, which are those sequences for which the operator "Q" is mere differentiation, and the group of sequences ofbinomial type , which are those that satisfy the identity:A Sheffer sequence { "pn"("x"): "n" = 0, 1, 2, ... } is of binomial type if and only if both:
and
:
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 asemidirect product of the group of Appell sequences and the group of sequences of binomial type. It follows that eachcoset 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
:
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
:
The sequence of
Hermite polynomials , the sequence ofBernoulli polynomials , and themonomial s { "xn" : "n" = 0, 1, 2, ... } are examples of Appell sequences.A Sheffer sequence "p""n" is characterised by its
exponential generating function :
where "A" and "B" are (formal) power series in "t". Sheffer sequences are thus examples of
generalized Appell polynomials and hence have an associatedrecurrence relation .Examples
Examples of polynomial sequences which are Sheffer sequences include:
* TheHermite polynomials ;
* TheBernoulli polynomials ;
* Themonomial s { "xn" : "n" = 0, 1, 2, ... } ;
* TheLaguerre polynomials ;
* TheAbel 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.