Olson's theorem for cyclic groups

2005/06/23 by Van Vu, V. Vu, Vu, V.
Mathematics · #11B75 #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.CO #math.NT #msc:11B75

paper · pdf · doi:10.48550/arxiv.math/0506483

arxiv created 2005/06/23 · openalex publication_date 2005/06/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

• On complete subsets of the cyclic group
• New examples of complete sets, with connections to a Diophantine theorem\n of Furstenberg
• Lower bounds for sumsets of multisets in Z_p²
• Strongly complete sets and a conjecture of Erdős
• Some new results about a conjecture by Brian Alspach