The multisubset sum problem for finite abelian groups
We use a similar techique as in  to derive a formula for the number of multisubsets of a finite abelian group G with any given size and any given multiplicity such that the sum is equal to a given element g ∈ G. This also gives the number of partitions of g into a given number of parts over a finite abelian group.
|Keywords||Character, Composition, Finite abelian groups, Finite fields, Partition, Polynomials, Subset sum|
|Journal||Ars Mathematica Contemporanea|
Muratović-Ribić, A. (Amela), & Wang, Q. (2015). The multisubset sum problem for finite abelian groups. Ars Mathematica Contemporanea, 8(2), 417–423.