pith. sign in

arxiv: 0810.1488 · v1 · submitted 2008-10-08 · 🧮 math.CO · math.AC

Plunnecke's inequality for different summands

classification 🧮 math.CO math.AC
keywords inequalityprovesizesumsetsapplicationassumecardinalitieschoices
0
0 comments X
read the original abstract

The aim of this paper is to prove a general version of Pl\"unnecke'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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.