Difference between revisions of "Multiset"

m
m
 
Line 3: Line 3:
 
For example, <math>\{1, 1, 2, 3\} \neq \{1, 2, 3\}</math> as multisets.
 
For example, <math>\{1, 1, 2, 3\} \neq \{1, 2, 3\}</math> as multisets.
  
Note that the order of the elements is unimportant, so <math>\displaystyle \{1, 1, 2, 3\}= \{3, 1, 2, 1\}</math>.
+
Note that the order of the elements is unimportant, so <math>\{1, 1, 2, 3\}= \{3, 1, 2, 1\}</math>.
  
 +
 +
{{stub}}
 
[[Category:Definition]]
 
[[Category:Definition]]

Latest revision as of 11:55, 26 June 2013

A multiset is a slight generalization of the notion of a set. A set is defined by whether or not each object is an element. A multiset is defined not just by its elements, but also by how many times each element is contained. In other words, a multiset is a set where duplication of elements is allowed.

For example, $\{1, 1, 2, 3\} \neq \{1, 2, 3\}$ as multisets.

Note that the order of the elements is unimportant, so $\{1, 1, 2, 3\}= \{3, 1, 2, 1\}$.


This article is a stub. Help us out by expanding it.

Invalid username
Login to AoPS