Sheffer Sequence Website Links For
Sequence 		 

Information About

Sheffer Sequence
  CATEGORIES ABOUT SHEFFER SEQUENCE
   
polynomials
   
factorial and binomial topics
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...



Qpn

is shift-equivariant. To say that ''Q'' is shift-equivariant means that if ''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".

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, and

:p_n(x)=\sum_{k=0}^n a_{n,k}x^k.

Then the umbral composition ''p'' o ''q'' is the polynomial sequence whose ''n''th term is

:(p_n\circ q)(x)=\sum_{k=0}^n a_{n,k}q_k(x).

Two important subgroups are the group of Appell sequences, which are those sequences for which the operator ''Q'' is 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


and

pn


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 sequence { ''xn'' : ''n'' = 0, 1, 2, ... } are examples of Appell sequences.

The article on Generalized Appell Polynomials gives a Generating Function and Recurrence Relation for the Sheffer polynomials.

of examples and perhaps applications should be added here.

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


SEE ALSO



REFERENCE


  • G.-C. Rota , D. Kahaner, and A. Odlyzko , ''"Finite Operator Calculus,"'' Journal of Mathematical Analysis and its Applications, vol. 42, no. 3, June 1973. Reprinted in the book with the same title, Academic Press, New York, 1975.