The multisubset sum problem for finite abelian groups
Combinatorics
2013-05-15 v1 Number Theory
Abstract
In this note, we give the explicit formula for the number of multisubsets of a finite abelian group with any given size such that the sum is equal to a given element . This also gives the number of partitions of into a given number of parts over a finite abelian group. An inclusion-exclusion formula for the number of multisubsets of a subset of with a given size and a given sum is also obtained.
Cite
@article{arxiv.1305.3259,
title = {The multisubset sum problem for finite abelian groups},
author = {Amela Muratovic-Ribic and Qiang Wang},
journal= {arXiv preprint arXiv:1305.3259},
year = {2013}
}