New Upper Bound for Sums of Dilates
Combinatorics
2017-08-29 v2 Number Theory
Abstract
For , let . Suppose are sufficiently large and comparable to each other. We prove that if and , then This improves upon a result of Bukh who shows that Our main technique is to combine Bukh's idea of considering the binary expansion of 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}
}