Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T08:55:11.460Z Has data issue: false hasContentIssue false

Restricted Partitions of Finite Sets

Published online by Cambridge University Press:  20 November 2018

M. Wyman
Affiliation:
University of Alberta
Rights & Permissions [Opens in a new window]

Extract

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.

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, r

Special 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].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1958