Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 65-72 |
Number of pages | 8 |
Journal | Discrete Mathematics |
Volume | 180 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 1998 |