Multiset
Summary
In mathematics, a multiset (or bag, or mset) is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements. The number of instances given for each element is called the multiplicity of that element in the multiset. As a consequence, an infinite number of multisets exist that contain only elements and , but vary in the multiplicities of their elements:
Further reading
- Wikipedia, page 305303, revision 1370132396, Multiset. adopted
About this page
| Tag | MYJ8Y050J0 |
|---|---|
| URI | m2://MYJ8Y050J0 |
| Aliases | bag-mathematics, multi-set, multichoose, multiset-coefficient, multiset-number, multisets, subbag |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.