New Upper Bound for Sums of Dilates
Keywords:
Sumsets, Dilates, Plünnecke-Ruzsa Inequality, Graph Decomposition, Biclique Partition
Abstract
For $\lambda \in \mathbb{Z}$, let $\lambda \cdot A = \{ \lambda a : a \in A\}$. Suppose $r, h\in \mathbb{Z}$ are sufficiently large and comparable to each other. We prove that if $|A+A| \le K |A|$ and $\lambda_1, \ldots, \lambda_h \le 2^r$, then
\[ |\lambda_1 \cdot A + \ldots + \lambda_h \cdot A | \le K^{ 7 rh /\ln (r+h) } |A|. \]
This improves upon a result of Bukh who shows that
\[ |\lambda_1 \cdot A + \ldots + \lambda_h \cdot A | \le K^{O(rh)} |A|. \]
Our main technique is to combine Bukh's idea of considering the binary expansion of $\lambda_i$ with a result on biclique decompositions of bipartite graphs.
Published
2017-08-25
How to Cite
Bush, A., & Zhao, Y. (2017). New Upper Bound for Sums of Dilates. The Electronic Journal of Combinatorics, 24(3), P3.37. https://doi.org/10.37236/6576
Article Number
P3.37