Variations on the Sum-Product Problem
Combinatorics
2014-01-09 v2
Abstract
This paper considers various formulations of the sum-product problem. It is shown that, for a finite set , giving a partial answer to a conjecture of Balog. In a similar spirit, it is established that a bound which is optimal up to constant and logarithmic factors. We also prove several new results concerning sum-product estimates and expanders, for example, showing that holds for a typical element of .
Cite
@article{arxiv.1312.6438,
title = {Variations on the Sum-Product Problem},
author = {Brendan Murphy and Oliver Roche-Newton and Ilya D. Shkredov},
journal= {arXiv preprint arXiv:1312.6438},
year = {2014}
}
Comments
30 pages, new version contains improved exponent in main theorem due to suggestion of M. Z. Garaev