m-submultisets and m-permutations of multisets elements

2020/09/02 by Oleksandr Makhnei, Makhnei, Oleksandr, Roman Zatorskii +1
Mathematics · #03E05 #FOS: Mathematics #General Mathematics (math.GM) #math.GM #msc:03E05

paper · pdf · doi:10.48550/arxiv.2009.01233

25 pages, in English

arxiv created 2020/09/02 · arxiv updated 2020/09/04

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.

Related

• On restricted permutations on regular multisets
• Multiset permutation generation by transpositions
• Counting sub-multisets of fixed cardinality
• Stirling permutations on multisets
• Some Connections Between Cycles and Permutations that Fix a Set and Touchard Polynomials and Covers of Multisets