# Sheffer sequence

In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence {pn(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 Isador M. Sheffer.

## Definition

Fix a polynomial sequence pn. Define a linear operator Q on polynomials in x by

${\displaystyle Qp_{n}(x)=np_{n-1}(x)\,.}$

This determines Q on all polynomials. The polynomial sequence pn 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) = Ta g(x) is a "shift" of g(x), then (Qf)(x) = (Qg)(x + a); i.e., Q commutes with every shift operator: TaQ =QTa. 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 { pn(x) : n = 0, 1, 2, 3, ... } and { qn(x) : n = 0, 1, 2, 3, ... } are polynomial sequences, given by

${\displaystyle 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 ${\displaystyle p\circ q}$ is the polynomial sequence whose nth term is

${\displaystyle (p_{n}\circ q)(x)=\sum _{k=0}^{n}a_{n,k}q_{k}(x)=\sum _{0\leq k\leq \ell \leq n}a_{n,k}b_{k,\ell }x^{\ell }}$

(the subscript n appears in pn, 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

${\displaystyle 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

${\displaystyle 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

${\displaystyle p_{0}(x)=1\,}$

and

${\displaystyle p_{n}(0)=0{\mbox{ for }}n\geq 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

${\displaystyle 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

${\displaystyle s_{n}(x+y)=\sum _{k=0}^{n}{n \choose k}x^{k}s_{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 pn is characterised by its exponential generating function

${\displaystyle \sum _{n=0}^{\infty }{\frac {p_{n}(x)}{n!}}t^{n}=A(t)\exp(xB(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:

## References

• Rota, G.-C.; Kahaner, D.; Odlyzko, A. (June 1973). "On the Foundations of Combinatorial Theory VIII: Finite Operator Calculus". Journal of Mathematical Analysis and Applications. 42 (3): 684–750. doi:10.1016/0022-247X(73)90172-8. Reprinted in the next reference.
• Rota, G.-C.; Doubilet, P.; Greene, C.; Kahaner, D.; Odlyzko, A.; Stanley, R. (1975). Finite Operator Calculus. Academic Press. ISBN 0-12-596650-4.
• Sheffer, I. M. (1939). "Some Properties of Polynomial Sets of Type Zero". Duke Mathematical Journal. 5 (3): 590–622. doi:10.1215/S0012-7094-39-00549-1.
• Roman, Steven (1984). The Umbral Calculus. Pure and Applied Mathematics. 111. London: Academic Press Inc. [Harcourt Brace Jovanovich Publishers]. ISBN 978-0-12-594380-2. MR 0741185. Reprinted by Dover, 2005.