The subset sum problem for finite abelian groups

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:120

Article

Kosters, Michiel

关键词: Subset sum;    Finite abelian group;    Character;   

DOI  :  10.1016/j.jcta.2012.10.006

来源: Elsevier

【 摘 要 】

Let G be a finite abelian group. A problem in combinatorics is to give an explicit formula for the number of subsets of G of size n which sum up to a given element of G. In this article we give a short proof, using character theory, of a formula for these numbers due to Li and Wan. We show that these numbers are nonzero except in four special cases. A similar formula is given when none of these subsets contain zero. (c) 2012 Elsevier Inc. All rights reserved.

【 授权许可】

Free