Variations on the Sum-Product Problem
Abstract
This paper considers various formulations of the sum-product problem. It is shown that, for a finite set A⊂R, |A(A+A)||A|32+1178, giving a partial answer to a conjecture of Balog. In a similar spirit, it is established that |A(A+A+A+A)||A|2|A|, 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 |A(A+a)||A|3/2 holds for a typical element of A.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.