Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-07-31T21:20:54.315Z Has data issue: false hasContentIssue false
  • English
  • Français

On Some Numbers Related to the Bell Numbers

Published online by Cambridge University Press:  20 November 2018

Stephen M. Tanny
Stephen M. Tanny*
Affiliation:
Economic Council of Canada Department of Mathematics, University of Toronto Toronto, Ontario
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The Bell numbers Bn can be defined by Bn= where S(n, k) is t n e Stirling number of the second kind. In this note we employ a technique developed by Rota (which formalizes the umbral calculus) to derive a veriety of facts concerning the related numbers and polynomials .

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 17 , Issue 5 , February 1975 , pp. 733 - 738
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Berge, C., Principles of Combinatorics, Academic Press, New York, 1971.Google Scholar
2. Carlitz, L., Eulerian numbers and polynomials, Math. Mag., Vol. 32 (1958–59), 247–260.Google Scholar
3. Comtet, L., Analyse Combinatoire, Tomes 1, 2, Presses Universitaires de France, 1970.Google Scholar
4. Dobinski, G., Grunert’s Archiv, 61 (1877), 333–336.Google Scholar
5. Feller, W., An Introduction to Probability Theory and its Applications, Vol. I, J. Wiley and Sons, New York, 1950.Google Scholar
6. Gross, O. A., Preferential arrangements, American Math. Monthly, Vol. 69, Jan. (1962), 4–8.Google Scholar
7. James, R. D., The factors of a square-free integer, Canadian Math. Bull.Google Scholar
8. Jordan, C., Calculus of Finite Differences, Second Ed., Chelsea Pub. Co., New York, 1960.Google Scholar
9. Mullin, R. and Rota, G.-C., On the foundations of combinatorial theory. III. Theory of binominal enumeration, Graph Theory and its Applications (1970), 167–213.Google Scholar
10. Riordan, J., An Introduction to Combinatorial Theory, J. Wiley and Sons, New York, 1958.Google Scholar
11. Riordan, J., Generating functions, in Applied Combinatorial Mathematics, ed. Edwin F. Beckenback, John Wiley and Sons, New York, (1964), 67–95.Google Scholar
12. Riordan, J., Combinatorial Identities, John Wiley and Sons, New York, 1968.Google Scholar
13. Rota, G.-C., The number of partitions of a set, American Math. Monthly, Vol. 71, No. 5, May, 1964.Google Scholar
14. Tanny, S. M., A probabilistic interpretation of Eulerian numbers, Duke Math. J., Vol. 40, No. 4 (1973), 717–722.Google Scholar
15. Worpitzky, J., Studien iiber die Bernoullischen und Eulerschen Zahlen, Journal fur die reine and angewandte Mathematik, Vol. 94 (1883), pp. 203–232.Google Scholar