English

New Upper Bound for Sums of Dilates

Combinatorics 2017-08-29 v2 Number Theory

Abstract

For λZ\lambda \in \mathbb{Z}, let λA={λa:aA}\lambda \cdot A = \{ \lambda a : a \in A\}. Suppose r,hZr, h\in \mathbb{Z} are sufficiently large and comparable to each other. We prove that if A+AKA|A+A| \le K |A| and λ1,,λh2r\lambda_1, \ldots, \lambda_h \le 2^r, then λ1A++λhAK7rh/ln(r+h)A. |\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 λ1A++λhAKO(rh)A. |\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 λi\lambda_i with a result on biclique decompositions of bipartite graphs.lique decompositions.

Keywords

Cite

@article{arxiv.1607.04888,
  title  = {New Upper Bound for Sums of Dilates},
  author = {Albert Bush and Yi Zhao},
  journal= {arXiv preprint arXiv:1607.04888},
  year   = {2017}
}
R2 v1 2026-06-22T14:56:44.887Z