Multiset Partitions

A multiset is an orderless collection of elements in which elements may be repeated, as in . In this Demonstration, the elements of the multiset are arranged at the corners of a regular -gon. Elements in the same submultiset are connected with line segments (singletons appear as dots).

(17 lines omitted)

Snapshot 1: when a multiset containing elements is a set—that is, no elements are repeated—the number of partitions is the Bell number, calculated with the Mathematica function BellB
Snapshot 2: at the other extreme is a multiset consisting of the same element repeated times, which has distinct partitions, where is the number of partitions of the integer , calculated with the Mathematica function PartitionsP
Snapshot 3: the general case has more than two elements with some element occurring more than once
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+