m-submultisets and m-permutations of multisets elements
General Mathematics
2020-09-04 v1
Abstract
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In particular, the Pascal triangle is generalized in the case of multisets.
Keywords
Cite
@article{arxiv.2009.01233,
title = {m-submultisets and m-permutations of multisets elements},
author = {Oleksandr Makhnei and Roman Zatorskii},
journal= {arXiv preprint arXiv:2009.01233},
year = {2020}
}
Comments
25 pages, in English