Set Partitions Match Restricted Growth Functions

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Set partitions of can be matched to restricted growth functions . Each entry of such a function (or -vector) is at most one more than the maximum of the preceding entries.


The following explains the matching.

Suppose the partition is . We write this more compactly as .

Suppose the blocks are in order of their least element. In this example those elements are and the blocks are in order.

To construct the restricted growth function, put below the indices given by block : . Put below the indices given by block : . Finally put below the indices given by block : . Then the restricted growth function is .

To go the other way, reverse the process. For example, if the growth function is , then block is because those are the indices for . Block is and block is . The blocks are ordered by least element: .


Contributed by: George Beck (March 2011)
Open content licensed under CC BY-NC-SA



D. Stanton and D. White, Constructive Combinatorics, New York: Springer–Verlag, 1986.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.