The critical number of finite abelian groups

2008/10/17 by Michael Freeze, Weidong Gao, Freeze, Michael +3
Mathematics · #11B50 #11B75 #11P70 #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11B50 #msc:11B75 #msc:11P70

paper · pdf · doi:10.48550/arxiv.0810.3223

arxiv created 2008/10/17 · arxiv updated 2009/12/01

Abstract

Let G be an additive, finite abelian group. The critical number cr(G) of G is the smallest positive integer ℓ such that for every subset S ⊂ G ∖ \0\ with |S| ≥ ℓ the following holds: Every element of G can be written as a nonempty sum of distinct elements from S. The critical number was first studied by P. Erdős and H. Heilbronn in 1964, and due to the contributions of many authors the value of \mathsf cr(G) is known for all finite abelian groups G except for G ≅ ℤ/pqℤ where p,q are primes such that p+\lfloor2√(p-2)\rfloor+1<q<2p. We determine that \mathsf cr(G)=p+q-2 for such groups.

Related

• Extremal incomplete sets in finite abelian groups
• On The Critical Number of Finite Groups (II)
• The h-critical number of finite abelian groups
• More on the h-critical numbers of finite abelian groups
• A New Proof of Kemperman's Theorem