The subset sum problem for finite abelian groups
classification
🧮 math.CO
math.GRmath.NT
keywords
abelianfiniteformulagivenumbersizesubsetsanother
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.