English

Olson's theorem for cyclic groups

Number Theory 2007-05-23 v1 Combinatorics

Abstract

Let nn be a large number. A subset AA of ZnZ_n is complete if SA=ZnS_A = Z_n, where SAS_A is the collection of the subset sums of AA. Olson proved that if nn is a prime and A>2n1/2|A|> 2n^{1/2} , then SAS_A is complete. We show that a similar result for the case when nn is a composite number, using a different approach.

Keywords

Cite

@article{arxiv.math/0506483,
  title  = {Olson's theorem for cyclic groups},
  author = {V. Vu},
  journal= {arXiv preprint arXiv:math/0506483},
  year   = {2007}
}