Geodesic
Restricted Partitions of Finite Sets
Canadian mathematical bulletin, Tome 1 (1958) no. 2, pp. 87-96

Voir la notice de l'article provenant de la source Cambridge University Press

In this paper we consider the following combinatorial problem. In how many ways can n distinguishable objects be placed into an unrestricted number of indistinguishable boxes, if each box can hold at most r objects? Let us denote this number by Gn, rSpecial cases of this problem have been the object of considerable study. In the case r = 2 we have the numbers Gn, 2 = Tn which have been treated by Rothe [12] as early as 1800. Tn is also the number of solutions of x2 = 1 in the symmetric group on n letters , and in this and related guises has been studied by Touchard [13], Chowla, Herstein and Moore [3] and two of the present authors [7]. 
Wyman, M. Restricted Partitions of Finite Sets. Canadian mathematical bulletin, Tome 1 (1958) no. 2, pp. 87-96. doi: 10.4153/CMB-1958-010-2
@article{10_4153_CMB_1958_010_2,
     author = {Wyman, M.},
     title = {Restricted {Partitions} of {Finite} {Sets}},
     journal = {Canadian mathematical bulletin},
     pages = {87--96},
     year = {1958},
     volume = {1},
     number = {2},
     doi = {10.4153/CMB-1958-010-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1958-010-2/}
}
TY  - JOUR
AU  - Wyman, M.
TI  - Restricted Partitions of Finite Sets
JO  - Canadian mathematical bulletin
PY  - 1958
SP  - 87
EP  - 96
VL  - 1
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1958-010-2/
DO  - 10.4153/CMB-1958-010-2
ID  - 10_4153_CMB_1958_010_2
ER  - 
%0 Journal Article
%A Wyman, M.
%T Restricted Partitions of Finite Sets
%J Canadian mathematical bulletin
%D 1958
%P 87-96
%V 1
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1958-010-2/
%R 10.4153/CMB-1958-010-2
%F 10_4153_CMB_1958_010_2

[1] 1. Becker, H. W., On the general theory of rhyme (abstract), Ball. Amer. Math. Soc. 52 (1946), 415. Google Scholar

[2] 2. Cernuschi, F. and Castegnette, L., Chains of rare events, Annals of Math. Statist. 17 (1946), 53-61. Google Scholar

[3] 3. Chowla, S., Herstein, I. N. and Moore, K., On recursions connected with symmetric groups I, Can. J. Math. 3 (1951), 328-334. Google Scholar

[4] 4. Finlayson, H., Numbers generated by eex-1, Master's thesis, University of Alberta (1954). Google Scholar

[5] 5. Gupta, H., Tables of distributions, Res. Bull. East Punjab Univ. (1950), 13-44. Google Scholar

[6] 6. Hadwiger, H., Gruppierung mit Nebenbedingungen, Mitteilungen der Vereinigung Schweizerischer Versicherungsmathematiker. 43 (1943), 113-123. Google Scholar

[7] 7. Moser, L. and Wyman, M., On solutions of xd = 1 in symmetric groups, Can. J. Math. 7 (1955), 159-168. Google Scholar

[8] 8. Moser, L. and Wyman, M., On an array of Aitken, Proc. Roy. Soc. Can. (Sec. III) 48 (1954), 31-37. Google Scholar

[9] 9. Moser, L. and Wyman, M., Asymptotic formula for the Bell numbers, Proc. Roy. Soc. Can. (Sec. III) 49 (1955), 49-54. Google Scholar

[10] 10. Moser, L. and Wyman, M., Asymptotic expansions. Can. J. Math. 8 (1956), 225-233. Google Scholar

[11] 11. Netto, E., Lehrbuch der Combinatorik (zweite Auflage, Leipzig 1927), Nachtrag von Viggo Brun, 283-286. Google Scholar

[12] 12. Rothe, H.A., Űber Permutationen in Beziehung auf die Stelle ihrer Elemente, Sammlung combinatorischer analytischer Abhandlungen, herausgegeben v. C.F. Hindenburg (zweite Sammlung, Leipzig 1800), 263-305. Google Scholar

[13] 13. Touchard, J., Sur les cycles des substitutions, Acta Math, 70 (1939), 243-297. Google Scholar

Cité par Sources :