Restricted sumsets and a conjecture of Lev

dc.creatorPan, Hao
dc.creatorSun, Zhi-Wei
dc.date2005-03-27
dc.date2006-10-29
dc.date.accessioned2026-07-07T06:39:40Z
dc.date.available2026-07-07T06:39:40Z
dc.descriptionLet A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is torsion-free or elementary abelian then |C|\geq |A|+|B|-|S| -m. We also prove that |C|\geq |A|+|B|-2|S|-m if the torsion subgroup of G is cyclic. In the case S={0} this provides an advance on a conjecture of Lev.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0503620
dc.identifierhttp://arxiv.org/abs/math/0503620
dc.identifierIsrael J. Math. 154(2006), 21-28
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101160
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject05A05; 11B75; 11P99; 20D60
dc.titleRestricted sumsets and a conjecture of Lev
dc.typetext

Files

Collections