| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1149648 | Journal of Statistical Planning and Inference | 2012 | 7 Pages |
Abstract
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a random variable with no reference to any probability space. We give several examples of applications and state an explicit form for the class of linear recurrences involving Sheffer sequences satisfying a special initial condition. The results here presented can be easily implemented in a symbolic software.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
E. Di Nardo, D. Senato,