New upper bound for sums of dilates

Publication date 8 September 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.04888, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p37

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph decomposition sumsets dilates biclique partition Plünnecke-Ruzsa inequality

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Abstract: For

l a m b d a i n m a t h b b Z

, let

l a m b d a c d o t A = l a m b d a a : a i n A

. Suppose

r, h i n m a t h b b Z

are sufficiently large and comparable to each other. We prove that if

| A + A | l e K | A |

and

l a m b d a_{1}, l d o t s, l a m b d a_{h} l e 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

l a m b d a_{i}

with a result on biclique decompositions of bipartite graphs.lique decompositions.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: New upper bound for sums of dilates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401423)