Document Zbl 0449.42012

Some comments on Rota’s umbral calculus. (English) Zbl 0449.42012

J. Math. Anal. Appl. 74, 456-463 (1980).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0449.42012

MSC:

42A38	Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
42C15	General harmonic expansions, frames
47B37	Linear operators on special spaces (weighted shifts, operators on sequence spaces, etc.)
05A15	Exact enumeration problems, generating functions

Keywords:

umbral calculus; delta functionals; sequences of binomial type

Citations:

Zbl 0267.05004; Zbl 0375.05007

Cite Review PDF

Full Text: DOI

References:

[1]	Mullin, R.; Rota, G.-C, Theory of binomial enumeration, (Graph Theory and Its Applications (1970), Academic Press: Academic Press New York/London)
[2]	Rota, G.-C; Kahaner, D.; Odlyzko, A., Finite operator calculus, J. Math. Anal. Appl., 42, 685-760 (1973) · Zbl 0267.05004
[3]	Roman, S. M.; Rota, G.-C, The umbral calculus, Advances in Math., 27, 95-188 (1978) · Zbl 0375.05007
[4]	Chihara, T. S., An Introduction to Orthogonal Polynomials (1978), Gordon & Breach: Gordon & Breach New York · Zbl 0389.33008
[5]	Donoghue, W. F., Distributions and Fourier Transforms (1969), Academic Press: Academic Press New York · Zbl 0188.18102
[6]	Ehrenpreis, L., Fourier Analysis in Several Complex Variables (1970), Interscience: Interscience New York/London · Zbl 0195.10401
[7]	Narashiman, R., Analysis on real and complex manifolds (1973), Elsevier: Elsevier New York
[8]	Zeilberger, D., Binary operations in the set of solutions of a partial difference equation, (Proc. Amer. Math. Soc., 62 (1977)), 242-244 · Zbl 0323.39006

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.