Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-25T09:15:53.672Z Has data issue: false hasContentIssue false
  • English
  • Français

Partitions of a finite set into structured subsets

Published online by Cambridge University Press:  24 October 2008

G. Pólya
G. Pólya
Affiliation:
Stanford University
Get access Rights & Permissions [Opens in a new window]

Extract

The aim of this paper is to present a common generalization of and , the Stirling numbers of the first and the second kind ((1), ex. 186–210, pp. 42–45).

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 77 , Issue 3 , May 1975 , pp. 453 - 458
Copyright
Copyright © Cambridge Philosophical Society 1975

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Póolya, G. and Szegö, G.Problems and theoremes in analysis (vol. I). Springer (1972).Google Scholar
(2)Pólya, G.Acta Math. 68 (1937), 145–254.CrossRefGoogle Scholar
(3)Riordan, J.An introduction to combinatory analysis (Wiley, 1958).Google Scholar