The multisubset sum problem for finite abelian groups
Abstract
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∈ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.