Abstract
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 γ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Di Nardo, E. Niederhausen, H. Senato, D., The Classical Umbral Calculus: Sheffer Sequences. arXiv:0810. 3554v1.
Di Nardo, E., Petrullo, and P., Senato, D., Cumulants, Convolutions and Volume Polynomial, preprint.
Di Nardo, E., Senato, D. (2006), An Umbral Setting for Cumulants and Factorial Moments, in “European J. Combin.”, 27, pp. 394–41.
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.
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.
Lehner, F. (2002), Free Cumulants and Enumeration of Connected Partitions, in “European J. Combin.”, 23, pp. 1025–31.
Nica, A., Speicher, R. (1997), A “Fourier Transform” for Multiplicative Functions on Non-crossing Partitions, in “J. Algebraic Combin.”, 6, pp. 141–60.
Petrullo, P., Senato, D., An Instance of Umbral Methods in Representation Theory: the Parking Function Module, in “Pure Math. Appl.”, to be published.
Roman, S. (1984), The Umbral Calculus, S. Eilenberg, H. Bass (eds.), London, Academic Press.
Rota, G.-C., Shen, J. (2000), On the Combinatorics of Cumulants, in “J. Combin. Theory Ser. A”, 91, pp. 283–304.
Rota, G.-C., Shen, J., Taylor, B. D. (1997), All Polynomials of Binomial Type are Represented by Abel Plynomials, in “Ann. Scuola Norm. Sup. Pisa Cl. Sci.”, 25/1, pp. 731–8.
Rota, G.-C., Taylor, B. D. (1994), The Classical Umbral Calculus, in “SIAM J. Math. Anal.”, 25, pp. 694–711.
Speicher, R. (1994), Multiplicative Functions on the Lattice of Non-crossing Partitions and Free Convolution, in “Math. Ann.”, 298, pp. 611–28.
Stanley, R. P. (1999), Enumerative Combinatorics, vol. 2, Cambridge, Cambridge University Press.
Speicher, R., Woroudi, R. (1997), Boolean Convolution, in Free Probability Theory (Waterloo, ON, 1995), Providence, RI, American Mathematical Society, pp. 267–79.
Voiculescu, D. (2000), Lectures on Free Probability Theory, in Lectures on Probability Theory and Statistics, Berlin, Springer, pp. 279–349.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Petrullo, P. (2009). A Symbolic Treatment of Abel Polynomials. In: Damiani, E., D’Antona, O., Marra, V., Palombi, F. (eds) From Combinatorics to Philosophy. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88753-1_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-88753-1_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88752-4
Online ISBN: 978-0-387-88753-1
eBook Packages: Computer ScienceComputer Science (R0)