Mathematics – Combinatorics
Scientific paper
2011-12-29
Mathematics
Combinatorics
3 pages
Scientific paper
Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan. We also give a formula for N(i,g)*, the number of subsets of G not containing 0 of size i which sum up to g. This generalizes another result of Wan.
No associations
LandOfFree
The subset sum problem for finite abelian groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The subset sum problem for finite abelian groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The subset sum problem for finite abelian groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-728460