Type:

Other

Description:

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: ... .

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:397557,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/SetPartitionsMatchRestrictedGrowthFunctions/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467