Skip to main content

Umbral nature of the Poisson random variables

  • Chapter
Algebraic Combinatorics and Computer Science

Abstract

The symbolic method, nowadays known as umbral calculus, has been extensively used since the nineteenth century although the mathematical community was sceptical of it, perhaps because of its lack of foundation. This method was fully developed by Rev. John Blissard in a series of papers beginning in 1861 [616]; nevertheless it is impossible to attribute the credit for the original idea to him alone since Blissard’s calculus has a mathematical source in symbolic differentiation. In [22] Lucas even claimed that the umbral calculus has its historical roots in the writing of Leibniz for the successive derivatives of a product with two or more factors; moreover Lucas held that this symbolic method had been developed subsequently by Laplace, by Vandermonde, by Herschel, and augmented by the works of Cayley and of Sylvester in the theory of forms. Lucas’ papers attracted considerable attention and the predominant contribution of Blissard to this method was kept in the background. Bell reviewed the whole subject in several papers, restoring the purport of the Blissard’s idea [4], and in 1940 he tried to give a rigorous foundation for the mystery at the bottom of the umbral calculus [5] but his attempt did not gain a hold. Indeed, in the first modern textbook of combinatorics [24], Riordan largely employed this symbolic method without giving any formal justification. It was Gian-Carlo Rota [26] who six years later disclosed the “umbral magic art” consisting in lowering and raising exponents bringing to the light the underlying linear functional. The ideas from [26] led Rota and his collaborators to conceive a beautiful theory which gave rise to a large variety of applications ([23, 27]). Some years later, Roman and Rota [25] gave rigorous form to the umbral tricks in the setting of Hopf algebras. On the other hand, as Rota himself has written in [28]: “…Although the notation of Hopf algebra satisfied the most ardent advocate of spic-and-span rigor, the translation of “classical”, umbral calculus into the newly found rigorous language made the method altogether unwieldy and unmanageable. Not only was the eerie feeling of witchcraft lost in the translation, but, after such a translation, the use of calculus to simplify computation and sharpen our intuition was lost by the wayside…” Thus in 1994 Rota and Taylor [28] started a rigorous and simple presentation of the umbral calculus in the spirit of the founders. The present article takes this last point of view.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bell, E.T. (1927): Partition polynomials. Ann. Math. (2) 29, 38–46

    Article  MATH  Google Scholar 

  2. Bell, E.T. (1934): Exponential polynomials. Ann. Math. (2) 35, 258–277

    Article  Google Scholar 

  3. Bell, E.T. (1938): The iterated exponential integers. Ann. Math. (2) 39, 539–557

    Article  Google Scholar 

  4. Bell, E.T. (1938): The history of Blissard’s symbolic method with a sketch of its inventor’s life. Amer. Math. Monthly 45, 414–421

    Article  MathSciNet  Google Scholar 

  5. Bell, E.T. (1940): Postulational bases for the umbral calculus. Amer. J. Math. 62, 717–724

    Article  MathSciNet  Google Scholar 

  6. Blissard, J. (1861): Theory of generic equations. Quart. J. Pure Appl. Math. 4, 279–305

    Google Scholar 

  7. Blissard, J. (1862): Theory of generic equations. Quart. J. Pure Appl. Math. 5, 58–75, 185-208

    Google Scholar 

  8. Blissard, J. (1862): Note on certain remarkable properties of numbers. Quart. J. Pure Appl. Math. 5, 184

    Google Scholar 

  9. Blissard, J. (1862): On the discovery and properties of a peculiar class of algebraic formulae. Quart. J. Pure Appl. Math. 5, 325–335

    Google Scholar 

  10. Blissard, J. (1864): Examples of the use and application of representative notation. Quart. J. Pure Appl. Math. 6, 49–64

    Article  Google Scholar 

  11. Blissard, J. (1864): On the generalization of certain formulae investigated by Mr. Walton. Quart. J. Pure Appl. Math. 6, 167–179

    Google Scholar 

  12. Blissard, J. (1864): Researches in analysis. Quart. J. Pure Appl. Math. 6, 142–257

    Google Scholar 

  13. Blissard, J. (1867): On the properties of the Δm0n class of numbers and of others analogous to them, as investigated by means of representative notation. Quart. J. Pure Appl. Math. 8, 85–110

    Google Scholar 

  14. Blissard, J. (1868): On the properties of the Δm0n class of numbers. (continued from Vol. VIII — p.110). Quart. J. Pure Appl. Math. 9, 82–94, 154-171

    Google Scholar 

  15. Blissard, J. (1868): Note on a certain formula. Quart. J. Pure Appl. Math. 9, 71–76

    Google Scholar 

  16. Blissard, J. (1868): On certain properties of the gamma function. Quart. J. Pure Appl. Math. 9, 280–296

    Google Scholar 

  17. Cerasoli, M. (1979): Enumerazione binomiale e processi stocastici di Poisson composti. Boll. Un. Mat. Ital. (A 5) 16, 310–315

    MathSciNet  MATH  Google Scholar 

  18. Di Bucchianico, A., Loeb, D. (1995): A selected survey of umbral calculus. Electron. J. Combin. 2, Dynamic Survey 3, 28 pp. (electronic; updated (2000))

    Google Scholar 

  19. Feller, W. (1950): An introduction to probability theory and its applications. Vol. I. Wiley, New York

    MATH  Google Scholar 

  20. Feller, W. (1966): An introduction to probability theory and its applications. Vol. II. Wiley, New York

    MATH  Google Scholar 

  21. Joyal, A. (1981): Une théorie combinatoire des séries formelles. Adv. Math. 42, 1–82

    Article  MathSciNet  MATH  Google Scholar 

  22. Lucas, E. (1891): Théorie des nombres. Gauthier-Villars, Paris

    MATH  Google Scholar 

  23. Mullin, R., Rota, G.-C. (1970): On the foundations of combinatorial theory. III. Theory of binomial enumeration. In: Harris, B. (ed.) Graph Theory and its Applications. Academic Press, New York, pp. 167–213

    Google Scholar 

  24. Riordan, J. (1958): An introduction to combinatorial analysis. Wiley, New York

    MATH  Google Scholar 

  25. Roman, S.M., Rota, G.-C. (1978): The umbral calculus. Adv. Math. 27, 95–188

    Article  MathSciNet  MATH  Google Scholar 

  26. Rota, G.-C. (1964): The number of partitions of a set. Amer. Math. Monthly 71, 498–504

    Article  MathSciNet  MATH  Google Scholar 

  27. Rota, G.-C., Kahaner D., Odlyzko, A. (1973): On the foundations of combinatorial theory. VIII. Finite operator calculus. J. Math. Anal. Appl. 42, 684–760

    Article  MathSciNet  MATH  Google Scholar 

  28. Rota, G.-C., Taylor, B.D. (1994): The classical umbral calculus. SIAM J. Math. Anal. 25, 694–711

    Article  MathSciNet  MATH  Google Scholar 

  29. Rota, G.-C., Shen, J., Taylor, B.D. (1997): All polynomials of binomial type are represented by Abel polynomials. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 25, 731–738

    MathSciNet  MATH  Google Scholar 

  30. Stam, A. J. (1988): Polynomials of binomial type and compound Poisson processes. J. Math. Anal. Appl. 130, 493–508

    Article  MathSciNet  MATH  Google Scholar 

  31. Steffensen, J.F. (1950): Interpolation. 2nd edition. Chelsea, New York

    MATH  Google Scholar 

  32. Taylor, B.D. (2000): Umbral presentations for polynomial sequences. Comput. Math. Appl., to appear

    Google Scholar 

  33. Touchard, J. (1956): Nombres exponentiels et nombres de Bernoulli. Canad. J. Math. 8, 305–320

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Italia

About this chapter

Cite this chapter

Di Nardo, E., Senato, D. (2001). Umbral nature of the Poisson random variables. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-88-470-2107-5_11

  • Publisher Name: Springer, Milano

  • Print ISBN: 978-88-470-2159-4

  • Online ISBN: 978-88-470-2107-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics