Plunnecke's inequality for different summands

dc.creatorGyarmati, Katalin
dc.creatorMatolcsi, Mate
dc.creatorRuzsa, Imre Z.
dc.date2008-10-08
dc.date.accessioned2026-07-07T10:08:34Z
dc.date.available2026-07-07T10:08:34Z
dc.descriptionThe aim of this paper is to prove a general version of Plünnecke's inequality. Namely, assume that for finite sets $A$, $B_1, ... B_k$ we have information on the size of the sumsets $A+B_{i_1}+... +B_{i_l}$ for all choices of indices $i_1, ... i_l.$ Then we prove the existence of a non-empty subset $X$ of $A$ such that we have `good control' over the size of the sumset $X+B_1+... +B_k$. As an application of this result we generalize an inequality of \cite{gymr} concerning the submultiplicativity of cardinalities of sumsets.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0810.1488
dc.identifierhttp://arxiv.org/abs/0810.1488
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171038
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject11B50; 11B75; 11P70
dc.titlePlunnecke's inequality for different summands
dc.typetext

Files

Collections