arXiv:1305.3259 [math.CO]AbstractReferencesReviewsResources
The multisubset sum problem for finite abelian groups
Amela Muratovic-Ribic, Qiang Wang
Published 2013-05-14Version 1
In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given number of parts over a finite abelian group. An inclusion-exclusion formula for the number of multisubsets of a subset of $G$ with a given size and a given sum is also obtained.
Related articles: Most relevant | Search more
An explicit formula for the number of permutations with a given number of alternating runs
arXiv:2010.07353 [math.CO] (Published 2020-10-14)
On the number of partitions of $n$ whose product of the summands is at most $n$
arXiv:1402.2361 [math.CO] (Published 2014-02-11)
An explicit formula for Bell numbers in terms of Stirling numbers and hypergeometric functions