New Upper Bound for Sums of Dilates
Keywords:
Sumsets, Dilates, Plünnecke-Ruzsa Inequality, Graph Decomposition, Biclique Partition
Abstract
For λ∈Z, let λ⋅A={λa:a∈A}. Suppose r,h∈Z are sufficiently large and comparable to each other. We prove that if |A+A|≤K|A| and λ1,…,λh≤2r, then
|λ1⋅A+…+λh⋅A|≤K7rh/ln(r+h)|A|.
This improves upon a result of Bukh who shows that
|λ1⋅A+…+λh⋅A|≤KO(rh)|A|.
Our main technique is to combine Bukh's idea of considering the binary expansion of λi with a result on biclique decompositions of bipartite graphs.