A Symbolic Treatment of Abel Polynomials
We study the umbral polynomials A(k) n(x, α) = x(x–k·α) n−1, by means of which a wide range of formal power series identities, including Lagrange inversion formula, can be usefully manipulated. We apply this syntax within cumulant theory, and show how moments and its formal cumulants (classical, free and Boolean) are represented by polynomials A(k) n(α, γ) for suitable choices of umbrae α and γ.
KeywordsFormal Power Series Noncrossing Partition Parking Function Free Convolution Free Probability Theory
Unable to display preview. Download preview PDF.
- 1.Di Nardo, E. Niederhausen, H. Senato, D., The Classical Umbral Calculus: Sheffer Sequences. arXiv:0810. 3554v1.Google Scholar
- 2.Di Nardo, E., Petrullo, and P., Senato, D., Cumulants, Convolutions and Volume Polynomial, preprint.Google Scholar
- 3.Di Nardo, E., Senato, D. (2006), An Umbral Setting for Cumulants and Factorial Moments, in “European J. Combin.”, 27, pp. 394–41.Google Scholar
- 4.Di Nardo, E., Senato, D. (2009), The Problems Eleven and Twelve of Rota’s Fubini Lectures: from Cumulants to Free Probability Theory, published in this volume.Google Scholar
- 5.Doubilet, P., Rota, G.-C., Stanley, R. P. (1972), On the Foundations of Combinatorial Theory (VI): The Idea of Generating Function, in Sixth Berkeley Symposium on Mathematical Statistics and Probability, Vol. II: Probability Theory, Berkeley, University of California, pp. 267–318.Google Scholar
- 8.Petrullo, P., Senato, D., An Instance of Umbral Methods in Representation Theory: the Parking Function Module, in “Pure Math. Appl.”, to be published.Google Scholar
- 15.Speicher, R., Woroudi, R. (1997), Boolean Convolution, in Free Probability Theory (Waterloo, ON, 1995), Providence, RI, American Mathematical Society, pp. 267–79.Google Scholar
- 16.Voiculescu, D. (2000), Lectures on Free Probability Theory, in Lectures on Probability Theory and Statistics, Berlin, Springer, pp. 279–349.Google Scholar