A generalization of sumsets modulo a prime Francesco Monopoli1 5 Dipartimento di Matematica, Universita`degli Studi di Milano 1 viaSaldini 50, Milano 0 I-20133 Italy 2 r a M 1 Abstract 3 Let A be a set in an abelian group G. For integers h,r ≥ 1 the generalized h- ] T foldsumset,denotedbyh(r)A,isthe setofsumsofhelementsofA,whereeach N element appears in the sum at most r times. If G=Z lower bounds for |h(r)A| . h t are known, as well as the structure of the sets of integers for which |h(r)A| is a m minimal. In this paper we generalize this result by giving a lower bound for [ |h(r)A| when G = Z/pZ for a prime p, and show new proofs for the direct and 2 inverse problems in Z. v 3 Keywords: Sumsets modulo a prime, Erdo˝s-Heilbronn conjecture 3 5 2010 MSC: Primary: 11B13,Secondary: 11P70. 6 0 . 1 1. Introduction 0 5 1 Let A={a1,...,ak} be a set of k elements in an abelian group G. : v Given integers h,r ≥1 define i X k k r h(r)A= riai :0≤ri ≤r for i=1,...,k and ri =h . a ( ) i=1 i=1 X X Note that the usual sumsets hA={a +···+a :a ∈A ∀i=1,...,h} j1 jh ji and the restricted sumsets hÂ={a +···+a :a ∈A ∀i=1,...,h,a 6=a for x6=y} j1 jh ji jx jy Email address: francesco.monopoli@unimi.it (FrancescoMonopoli) Preprint submitted toElsevier April 1, 2015 can be recoveredfrom this notation, since hA=h(h)A and hÂ=h(1)A. When G = Z lower bounds for the cardinality of sumsets and restricted sumsets are well-known. In this setting, the problem of giving lower bounds for the cardinality of h(r)A for nontrivial values of h,r and k has been studied in [1], where the authors proved the following theorem holding for subsets of the integers. Theorem 1.1. Let h,r be non-negative integers, h=mr+ǫ,0≤ǫ≤r−1. Let A be a nonempty finite set of integers with |A|=k such that 1≤h≤rk. Then |h(r)A|≥hk−m2r+1−2mǫ−ǫ. (1) Here the conditionh≤rk is necessary,for otherwisethe set h(r)A wouldbe empty. The lower bound in Theorem 1.1 is the best one possible, as shown by any arithmetic progression. Ageneralizationoftheorem1.1canbefoundin[2],wheretheauthorsproved lowerboundsforgeneralizedsumsetswherethejthelementofAcanberepeated up to r times, with the r ’s not necessarily all equal to r. j j In the first section of this paper we will exhibit a new proof of theorem 1.1 In the second section we prove the main result of the paper, which states that a similar lower bound also holds when G=Z/pZ for a prime p. Theorem 1.2. Let h = mr+ǫ,0 ≤ ǫ ≤ r−1. Let A ⊆ Z/pZ be a nonempty set with |A|=k such that 1≤r ≤h≤rk. Then |h(r)A|≥min(p,hk−m2r+1−2mǫ−ǫ). The authors in [1] also solvedthe inverse problemrelated to h(r)A, showing that, up to a few exceptions, any set A satisfying (1) must be an arithmetic progression: Theorem 1.3. Let k ≥5. Let r and h=mr+ǫ,0≤ǫ≤r−1 be integers with 2≤r ≤h≤rk−2. Then any set of k integers A such that |h(r)A|=hk−m2r+1−2mǫ−ǫ (2) 2 is a k-term arithmetic progression. InthethirdsectionweshowhowwecandeduceTheorem1.3fromtheresults in the first two sections and discuss the analogue problem in groups of prime order. 2. Direct problem To prove Theorem 1.1, and later Theorem 1.2, we first deal with the case r|h,showingthatforasubsetAofanabeliangroupGwehaveh(r)A=r(mÂ). Lemma 2.1. If h=mr, A⊆G, |A|=k and rk ≥h≥1 , then h(r)A=r(mÂ). Proof. Clearly r(mÂ) ⊆ h(r)A, since no element in A can be summed more than r times in order to get an element of r(mÂ). To provethe converseinclusion, take x∈h(r)A so that, after reorderingthe elements of A if necessary, x = l r(0)a with 1 ≤ l ≤ k,1 ≤ r(0) ≤ r and i=1 i i i l r(0) =h. Let also r(0) =0 fPor l+1≤i≤k. i=1 i i P Wenowdescribeanalgorithmwhichshowshowwecanwritexasanelement in r(mÂ). If possible, for every j = 1,...,r take distinct elements r(j−1),...,r(j−1) j1 jm (j−1) which are greater or equal to the remaining r and define s m x = a , j ji i=1 X r(j−1)−1 if s=j for some i=1,...,m s i r(j) = (3) s  rs(j−1) otherwise. If we can applythis pocedure for every j = 1,...,r, then we can write x=x +···+x with x ∈mÂ, thus proving h(r)A⊆r(mÂ). 1 r i Todo thiswe needto provethatateverystepj =1,...,r the followingtwo conditions are satisfied: 3 1. |{r(j−1) ≥1} |≥m, i i (j) 2. max (r )≤r−j. 1≤i≤k i Since k r(0) = h = mr, the first condition holds for j = 1, and so we can i=1 i definePri(1) as in (3). Clearly maxi(ri(1)) ≤ r −1, for otherwise we could find m+1 distinct indexes s such that r(0) = r, which would imply k r(0) ≥ s i=1 i (m+1)r >h, a contradiction. P Suppose now that condition (1) does not hold for every j ∈[1,r], and let j′ be the minimal j such that |{r(j′−1) ≥1}|=N 1 for a indexes, a≤N k. As already observed in [1], we have |h(r)A|=|(rk−h)(r)A|. 6 Then, if r−1≤m+ǫ, |h(r)A|=|(r(k−m−1)+(r−ǫ))(r)A|, and hence we can argue as in the first case to obtain the desired lower bound. Suppose now r−1>m+ǫ>k. Then B =(m+ǫ)((m+1)Â)+(r−1−m−ǫ)(mÂ)⊆h(r)A and again |h(r)A| = |B (h(r)A\B)| ≥ hka−m2r+1−2mǫ−ǫ−(m2+m)+|h(r)A\B|. (5) Observe that m+1 m minB =(m+ǫ) a +(r−1−m−ǫ) a i i i=1 i=1 X X m =(r−1) a +(m+ǫ)a , i m+1 i=1 X m minA=r a +ǫa . i m+1 i=1 X If we let m m T =(r−1) a +ǫa + a +xa , x,y i m+1 i m+1 i=1 i=x,i6=y X X with x∈[1,m],y ∈[x,m], we have T ∈h(r)A, and x,y minA

A generalization of sumsets modulo a prime

Similar A generalization of sumsets modulo a prime