Abstract
Let S be a generating subset of a cyclic group
G such that 0=∉S and
[mid ]S[mid ][ges ]5. We show
that the number of sums of the subsets of S is at
least min([mid ]G[mid ], 2[mid ]S[mid ]).
Our bound is best possible. We obtain similar results for
abelian groups and mention the generalization to
nonabelian groups.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献