The subset sum problem for finite abelian groups
Combinatorics
2015-09-08 v1 Group Theory
Number Theory
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.
Cite
@article{arxiv.1112.6294,
title = {The subset sum problem for finite abelian groups},
author = {Michiel Kosters},
journal= {arXiv preprint arXiv:1112.6294},
year = {2015}
}
Comments
3 pages