We apply recent constructions of free Baxter algebras to the study of the umbral calculus. We give a characterization of the umbral calculus in terms of the Baxter algebra. This characterization leads to a natural generalization of the umbral calculus that includes the classical umbral calculus in a
Computer algebra and Umbral Calculus
β Scribed by A. Bottreau; A. Di Bucchianico; D.E. Loeb
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 381 KB
- Volume
- 180
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Rota's Umbral Calculus uses sequences of Sheffer polynomials to count certain combinatorial objects. We review this theory and some of its generalizations in light of our computer implementation (Maple V.3). A Mathematica version of this package is being developed in parallel.
π SIMILAR VOLUMES
Rota, using the operator of differentiation D, constructed the logarithmic algebra that is the generalization of the algebra of formal Laurent series. They also introduced Appell graded logarithmic sequences and binomial (basic) graded logarithmic sequences as sequences of elements of the logarithmi
We revisit the umbral methods used by L. J. Rogers in his second proof of the Rogers Ramanujan identities. We shall study how subsequent methods such as the Bailey chains and their variants arise naturally from Rogers' insights. We conclude with the introduction of multi-dimensional Bailey chains an
The umbral calculus is used to generalize Bernstein polynomials and BΓ©zier curves. This adds great geometric flexibility to these fundamental objects of computer aided geometric design while retaining their basic properties.